About the Execution of LTSMin+red for SafeBus-COL-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
376.388 | 10884.00 | 26045.00 | 118.40 | ???F????F??FF?T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r524-tall-171679080100353.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is SafeBus-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080100353
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.9K Apr 12 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 14:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 14:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 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 42K 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 SafeBus-COL-03-CTLCardinality-2024-00
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-01
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-02
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-03
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-04
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-05
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-06
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-07
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-08
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-09
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-10
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-11
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-12
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-13
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-14
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717222155154
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:09:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:09:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:09:16] [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 06:09:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 06:09:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 571 ms
[2024-06-01 06:09:16] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2024-06-01 06:09:16] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2024-06-01 06:09:17] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-06-01 06:09:17] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (8 resets) in 2063 ms. (19 steps per ms) remains 58/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
// Phase 1: matrix 14 rows 17 cols
[2024-06-01 06:09:18] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 06:09:18] [INFO ] State equation strengthened by 3 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 4/4 constraints. Problems are: Problem set: 40 solved, 18 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 3/7 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/31 variables, 17/24 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/27 constraints. Problems are: Problem set: 57 solved, 1 unsolved
[2024-06-01 06:09:18] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 1/28 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/28 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/28 constraints. Problems are: Problem set: 57 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 28 constraints, problems are : Problem set: 57 solved, 1 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 17/17 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 57 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/2 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/14 variables, 3/5 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/15 variables, 1/7 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/28 variables, 15/22 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/28 variables, 2/24 constraints. Problems are: Problem set: 57 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 28/31 variables, and 25 constraints, problems are : Problem set: 58 solved, 0 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 3/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 15/17 constraints, ReadFeed: 2/3 constraints, PredecessorRefiner: 1/58 constraints, Known Traps: 1/1 constraints]
After SMT, in 524ms problems are : Problem set: 58 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 58 atomic propositions for a total of 16 simplifications.
[2024-06-01 06:09:18] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 06:09:18] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:09:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SafeBus-COL-03-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:09:18] [INFO ] Flatten gal took : 3 ms
Domain [It(3), It(3)] of place AMC breaks symmetries in sort It
[2024-06-01 06:09:18] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 14 ms.
[2024-06-01 06:09:18] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Support contains 48 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-01 06:09:18] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-06-01 06:09:18] [INFO ] Computed 17 invariants in 8 ms
[2024-06-01 06:09:19] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 06:09:19] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-06-01 06:09:19] [INFO ] Invariant cache hit.
[2024-06-01 06:09:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 06:09:19] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-06-01 06:09:19] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-06-01 06:09:19] [INFO ] Invariant cache hit.
[2024-06-01 06:09:19] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 12/29 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-06-01 06:09:20] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:09:20] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/31 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/31 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/98 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/98 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/98 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 98 constraints, problems are : Problem set: 9 solved, 79 unsolved in 1960 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 9 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 14/31 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-06-01 06:09:21] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/32 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/32 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/86 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/99 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 79/178 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-06-01 06:09:21] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/179 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/179 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-06-01 06:09:22] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/180 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/180 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/180 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 180 constraints, problems are : Problem set: 9 solved, 79 unsolved in 3269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/88 constraints, Known Traps: 17/17 constraints]
After SMT, in 5287ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 5290ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 54/54 places, 82/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5446 ms. Remains : 54/54 places, 82/91 transitions.
Support contains 48 out of 54 places after structural reductions.
[2024-06-01 06:09:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:09:24] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:09:24] [INFO ] Input system was already deterministic with 82 transitions.
RANDOM walk for 40000 steps (8 resets) in 1136 ms. (35 steps per ms) remains 30/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
[2024-06-01 06:09:25] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 06:09:25] [INFO ] Invariant cache hit.
[2024-06-01 06:09:25] [INFO ] State equation strengthened by 13 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 24 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 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 AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 7/13 constraints. Problems are: Problem set: 29 solved, 1 unsolved
[2024-06-01 06:09:25] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:09:25] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/15 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/53 variables, 3/18 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/54 variables, 1/19 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 68/122 variables, 54/73 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 13/86 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/86 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/86 constraints. Problems are: Problem set: 29 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 86 constraints, problems are : Problem set: 29 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 29 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 2/2 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/23 variables, 2/4 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/50 variables, 10/14 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/15 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/52 variables, 2/17 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 1/18 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/18 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 67/119 variables, 52/70 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 12/82 constraints. Problems are: Problem set: 29 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 119/122 variables, and 83 constraints, problems are : Problem set: 30 solved, 0 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 52/54 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 1/30 constraints, Known Traps: 2/2 constraints]
After SMT, in 256ms problems are : Problem set: 30 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 30 atomic propositions for a total of 12 simplifications.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
Support contains 36 out of 54 places (down from 40) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 11 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
RANDOM walk for 10 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
FORMULA SafeBus-COL-03-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 54/54 places, 82/82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:09:25] [INFO ] Input system was already deterministic with 82 transitions.
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:09:25] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 06:09:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 82 transitions and 457 arcs took 1 ms.
Total runtime 9423 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=
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="SafeBus-COL-03"
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 SafeBus-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 r524-tall-171679080100353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-03.tgz
mv SafeBus-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 '
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 ;