About the Execution of LTSMin+red for BridgeAndVehicles-COL-V04P05N02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 448.707 | 20385.00 | 43220.00 | 104.30 | T?FTFT?F??TTTFFF | normal |
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.r472-tajo-171620398600001.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 ltsminxred
Input is BridgeAndVehicles-COL-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398600001
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 9.2K Apr 13 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 13 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 01:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 13 01:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 01:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 01:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717217821629
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V04P05N02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:57:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:57:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:57:03] [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-06-01 04:57:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:57:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 720 ms
[2024-06-01 04:57:04] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2024-06-01 04:57:04] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-06-01 04:57:04] [INFO ] Skeletonized 16 HLPN properties in 8 ms.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
RANDOM walk for 40000 steps (8 resets) in 1517 ms. (26 steps per ms) remains 41/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 04:57:05] [INFO ] Computed 4 invariants in 6 ms
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 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 AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
After SMT solving in domain Real declared 12/22 variables, and 4 constraints, problems are : Problem set: 39 solved, 0 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 223ms problems are : Problem set: 39 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 39 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:05] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-06-01 04:57:05] [INFO ] Flatten gal took : 14 ms
[2024-06-01 04:57:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:05] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD $cA 1) 5)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 5) 5) 5)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 3)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 04:57:05] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions 326 arcs in 14 ms.
[2024-06-01 04:57:05] [INFO ] Unfolded 4 HLPN properties in 0 ms.
Support contains 13 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Applied a total of 0 rules in 5 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Running 49 sub problems to find dead transitions.
[2024-06-01 04:57:05] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2024-06-01 04:57:05] [INFO ] Computed 7 invariants in 7 ms
[2024-06-01 04:57:05] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 04:57:06] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 6 ms to minimize.
[2024-06-01 04:57:06] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
[2024-06-01 04:57:06] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/8 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/10 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 8 solved, 41 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD17 is UNSAT
At refinement iteration 5 (OVERLAPS) 34/62 variables, 28/38 constraints. Problems are: Problem set: 10 solved, 39 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 6/44 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/44 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/44 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 44 constraints, problems are : Problem set: 10 solved, 39 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 10 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/8 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/10 constraints. Problems are: Problem set: 10 solved, 39 unsolved
[2024-06-01 04:57:07] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/11 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 34/62 variables, 28/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 6/45 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 39/84 constraints. Problems are: Problem set: 10 solved, 39 unsolved
[2024-06-01 04:57:07] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 1/85 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/85 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/85 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 85 constraints, problems are : Problem set: 10 solved, 39 unsolved in 1586 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 39/49 constraints, Known Traps: 5/5 constraints]
After SMT, in 2415ms problems are : Problem set: 10 solved, 39 unsolved
Search for dead transitions found 10 dead transitions in 2419ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
[2024-06-01 04:57:08] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 28 cols
[2024-06-01 04:57:08] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 04:57:08] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 04:57:08] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-06-01 04:57:08] [INFO ] Invariant cache hit.
[2024-06-01 04:57:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:57:08] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/28 places, 42/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2582 ms. Remains : 28/28 places, 42/52 transitions.
Support contains 13 out of 28 places after structural reductions.
[2024-06-01 04:57:08] [INFO ] Flatten gal took : 26 ms
[2024-06-01 04:57:08] [INFO ] Flatten gal took : 8 ms
[2024-06-01 04:57:08] [INFO ] Input system was already deterministic with 42 transitions.
RANDOM walk for 40000 steps (916 resets) in 875 ms. (45 steps per ms) remains 12/22 properties
BEST_FIRST walk for 40003 steps (264 resets) in 313 ms. (127 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (410 resets) in 287 ms. (138 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (444 resets) in 290 ms. (137 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (264 resets) in 295 ms. (135 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (384 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (411 resets) in 280 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (444 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (407 resets) in 182 ms. (218 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (406 resets) in 187 ms. (212 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (418 resets) in 304 ms. (131 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (411 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (440 resets) in 201 ms. (198 steps per ms) remains 12/12 properties
[2024-06-01 04:57:09] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-06-01 04:57:09] [INFO ] Invariant cache hit.
[2024-06-01 04:57:09] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 15/58 variables, and 4 constraints, problems are : Problem set: 12 solved, 0 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/28 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 12 atomic propositions for a total of 4 simplifications.
[2024-06-01 04:57:09] [INFO ] Flatten gal took : 19 ms
[2024-06-01 04:57:09] [INFO ] Flatten gal took : 5 ms
[2024-06-01 04:57:09] [INFO ] Input system was already deterministic with 42 transitions.
Computed a total of 19 stabilizing places and 18 stable transitions
Graph (complete) has 195 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Graph (complete) has 195 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 37 ms. Remains 25 /28 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2024-06-01 04:57:09] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 25 cols
[2024-06-01 04:57:09] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 04:57:09] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 04:57:10] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 37 constraints, problems are : Problem set: 0 solved, 38 unsolved in 4557 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 04:57:14] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/54 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 76 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
After SMT, in 5614ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 5615ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 5652 ms. Remains : 25/28 places, 41/42 transitions.
[2024-06-01 04:57:15] [INFO ] Flatten gal took : 4 ms
[2024-06-01 04:57:15] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:57:15] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 42
Applied a total of 2 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2024-06-01 04:57:15] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2024-06-01 04:57:15] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 04:57:15] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 04:57:15] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2778 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 77 constraints, problems are : Problem set: 0 solved, 39 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
After SMT, in 3349ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 3349ms
Finished structural reductions in LTL mode , in 1 iterations and 3350 ms. Remains : 26/28 places, 42/42 transitions.
[2024-06-01 04:57:18] [INFO ] Flatten gal took : 4 ms
[2024-06-01 04:57:18] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:57:18] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 42
Applied a total of 1 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2024-06-01 04:57:18] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 27 cols
[2024-06-01 04:57:18] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 04:57:18] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 04:57:19] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/57 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/57 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 40 constraints, problems are : Problem set: 0 solved, 39 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/57 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 04:57:19] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/57 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 80 constraints, problems are : Problem set: 0 solved, 39 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 1276ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1276ms
Finished structural reductions in LTL mode , in 1 iterations and 1278 ms. Remains : 27/28 places, 42/42 transitions.
[2024-06-01 04:57:20] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:57:20] [INFO ] Flatten gal took : 2 ms
[2024-06-01 04:57:20] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Graph (complete) has 195 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 3 ms. Remains 25 /28 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2024-06-01 04:57:20] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 25 cols
[2024-06-01 04:57:20] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 04:57:20] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 04:57:20] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 37 constraints, problems are : Problem set: 0 solved, 38 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 04:57:21] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/54 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 76 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
After SMT, in 1489ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1489ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 1494 ms. Remains : 25/28 places, 41/42 transitions.
[2024-06-01 04:57:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:57:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 04:57:21] [INFO ] Input system was already deterministic with 41 transitions.
[2024-06-01 04:57:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:57:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:57:21] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 04:57:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 28 places, 42 transitions and 254 arcs took 4 ms.
Total runtime 18543 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-01
Could not compute solution for formula : BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-06
Could not compute solution for formula : BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-08
Could not compute solution for formula : BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-09
BK_STOP 1717217842014
--------------------
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
mcc2024
ctl formula name BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/606/ctl_0_
ctl formula name BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/606/ctl_1_
ctl formula name BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/606/ctl_2_
ctl formula name BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/606/ctl_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="BridgeAndVehicles-COL-V04P05N02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-COL-V04P05N02, 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 r472-tajo-171620398600001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V04P05N02.tgz
mv BridgeAndVehicles-COL-V04P05N02 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;