About the Execution of LTSMin+red for PolyORBNT-COL-S10J80
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15848.016 | 195512.00 | 282232.00 | 195.00 | ??F?F?FF?T??FTF? | 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.r516-tajo-171654447100433.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 PolyORBNT-COL-S10J80, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447100433
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.7K Apr 12 11:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 11:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 10:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 10:45 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 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 12 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 12 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 95K 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 PolyORBNT-COL-S10J80-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-COL-S10J80-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717259611541
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J80
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:33:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:33:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:33:33] [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 16:33:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:33:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 696 ms
[2024-06-01 16:33:33] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
[2024-06-01 16:33:33] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 7 ms.
[2024-06-01 16:33:33] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40004 steps (2279 resets) in 1037 ms. (38 steps per ms) remains 54/70 properties
BEST_FIRST walk for 4003 steps (83 resets) in 52 ms. (75 steps per ms) remains 47/54 properties
BEST_FIRST walk for 4004 steps (82 resets) in 122 ms. (32 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (69 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (75 resets) in 52 ms. (75 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (75 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (84 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (81 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4011 steps (97 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4011 steps (79 resets) in 20 ms. (191 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (78 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (83 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (102 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (75 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (83 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (130 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (74 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (129 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (84 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4008 steps (129 resets) in 31 ms. (125 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (80 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (70 resets) in 37 ms. (105 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (81 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (80 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (74 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4005 steps (72 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (81 resets) in 31 ms. (125 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4007 steps (73 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4006 steps (84 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (81 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (81 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (73 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (78 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (86 resets) in 115 ms. (34 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (92 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (79 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (108 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4017 steps (84 resets) in 12 ms. (309 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (71 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (81 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (73 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4005 steps (71 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (83 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (80 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (78 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (101 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (79 resets) in 31 ms. (125 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (96 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 16:33:35] [INFO ] Computed 13 invariants in 8 ms
[2024-06-01 16:33:35] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp49 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 38 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 3/5 constraints. Problems are: Problem set: 16 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 16 solved, 31 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 3 (OVERLAPS) 8/42 variables, 4/9 constraints. Problems are: Problem set: 27 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 27 solved, 20 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 5 (OVERLAPS) 6/48 variables, 4/13 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 45 solved, 2 unsolved
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp60 is UNSAT
After SMT solving in domain Real declared 86/86 variables, and 61 constraints, problems are : Problem set: 47 solved, 0 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 587ms problems are : Problem set: 47 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 47 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:33:35] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 16:33:35] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:33:35] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:33:35] [INFO ] Flatten gal took : 8 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:33:36] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 206 ms.
[2024-06-01 16:33:36] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 52 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 623 out of 1614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 3390
Applied a total of 10 rules in 258 ms. Remains 1604 /1614 variables (removed 10) and now considering 3390/3390 (removed 0) transitions.
Running 3379 sub problems to find dead transitions.
[2024-06-01 16:33:36] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1604 cols
[2024-06-01 16:33:36] [INFO ] Computed 182 invariants in 317 ms
[2024-06-01 16:33:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1593 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 3379 unsolved
SMT process timed out in 49914ms, After SMT, problems are : Problem set: 0 solved, 3379 unsolved
Search for dead transitions found 0 dead transitions in 49969ms
[2024-06-01 16:34:26] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 16:34:26] [INFO ] Invariant cache hit.
[2024-06-01 16:34:27] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2024-06-01 16:34:27] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 16:34:27] [INFO ] Invariant cache hit.
[2024-06-01 16:34:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:34:44] [INFO ] Implicit Places using invariants and state equation in 16161 ms returned []
Implicit Place search using SMT with State Equation took 17481 ms to find 0 implicit places.
Running 3379 sub problems to find dead transitions.
[2024-06-01 16:34:44] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 16:34:44] [INFO ] Invariant cache hit.
[2024-06-01 16:34:44] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1593 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 3379 unsolved
SMT process timed out in 55654ms, After SMT, problems are : Problem set: 0 solved, 3379 unsolved
Search for dead transitions found 0 dead transitions in 55768ms
Starting structural reductions in LTL mode, iteration 1 : 1604/1614 places, 3390/3390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123557 ms. Remains : 1604/1614 places, 3390/3390 transitions.
Support contains 623 out of 1604 places after structural reductions.
[2024-06-01 16:35:40] [INFO ] Flatten gal took : 393 ms
[2024-06-01 16:35:40] [INFO ] Flatten gal took : 270 ms
[2024-06-01 16:35:41] [INFO ] Input system was already deterministic with 3390 transitions.
Support contains 621 out of 1604 places (down from 623) after GAL structural reductions.
RANDOM walk for 40000 steps (2240 resets) in 4705 ms. (8 steps per ms) remains 25/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 73 ms. (54 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 58 ms. (67 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 43 ms. (90 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (41 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (39 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (40 resets) in 52 ms. (75 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (41 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 56 ms. (70 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (39 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (40 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 52 ms. (75 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (39 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (40 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (40 resets) in 49 ms. (80 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (40 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (48 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 70 ms. (56 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (40 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
[2024-06-01 16:35:43] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 16:35:43] [INFO ] Invariant cache hit.
[2024-06-01 16:35:43] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 1076/1519 variables, 95/95 constraints. Problems are: Problem set: 15 solved, 10 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1519 variables, 3/98 constraints. Problems are: Problem set: 20 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1519 variables, 0/98 constraints. Problems are: Problem set: 20 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 81/1600 variables, 81/179 constraints. Problems are: Problem set: 20 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1600 variables, 0/179 constraints. Problems are: Problem set: 20 solved, 5 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 6 (OVERLAPS) 3/1603 variables, 3/182 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1603 variables, 0/182 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3381/4984 variables, 1603/1785 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4984 variables, 1/1786 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4984 variables, 0/1786 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/4985 variables, 1/1787 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4985 variables, 0/1787 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/4985 variables, 0/1787 constraints. Problems are: Problem set: 21 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4985/4985 variables, and 1787 constraints, problems are : Problem set: 21 solved, 4 unsolved in 3067 ms.
Refiners :[Positive P Invariants (semi-flows): 176/176 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1604/1604 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 505/753 variables, 83/83 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/753 variables, 0/83 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 812/1565 variables, 83/166 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1565 variables, 0/166 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 27/1592 variables, 9/175 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1592 variables, 0/175 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/1602 variables, 6/181 constraints. Problems are: Problem set: 21 solved, 4 unsolved
[2024-06-01 16:35:49] [INFO ] Deduced a trap composed of 27 places in 988 ms of which 81 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 1/182 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 0/182 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1603 variables, 1/183 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1603 variables, 0/183 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3381/4984 variables, 1603/1786 constraints. Problems are: Problem set: 21 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4984/4985 variables, and 1787 constraints, problems are : Problem set: 21 solved, 4 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 176/176 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1603/1604 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/20 constraints, Known Traps: 1/1 constraints]
After SMT, in 8409ms problems are : Problem set: 21 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 248 out of 1604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1604/1604 places, 3390/3390 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1604 transition count 3385
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1599 transition count 3385
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 10 place count 1599 transition count 3301
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 178 place count 1515 transition count 3301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 1514 transition count 3300
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 1514 transition count 3300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 1512 transition count 3298
Applied a total of 184 rules in 1082 ms. Remains 1512 /1604 variables (removed 92) and now considering 3298/3390 (removed 92) transitions.
Running 3287 sub problems to find dead transitions.
[2024-06-01 16:35:52] [INFO ] Flow matrix only has 3289 transitions (discarded 9 similar events)
// Phase 1: matrix 3289 rows 1512 cols
[2024-06-01 16:35:53] [INFO ] Computed 182 invariants in 284 ms
[2024-06-01 16:35:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1502 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 3287 unsolved
SMT process timed out in 46269ms, After SMT, problems are : Problem set: 0 solved, 3287 unsolved
Search for dead transitions found 0 dead transitions in 46333ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47430 ms. Remains : 1512/1604 places, 3298/3390 transitions.
RANDOM walk for 2373 steps (155 resets) in 50 ms. (46 steps per ms) remains 0/4 properties
Successfully simplified 21 atomic propositions for a total of 8 simplifications.
[2024-06-01 16:36:39] [INFO ] Flatten gal took : 202 ms
[2024-06-01 16:36:39] [INFO ] Flatten gal took : 202 ms
[2024-06-01 16:36:39] [INFO ] Input system was already deterministic with 3390 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1604/1604 places, 3390/3390 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1604 transition count 3386
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 1600 transition count 3385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1599 transition count 3385
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 1599 transition count 3381
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 18 place count 1595 transition count 3381
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 1594 transition count 3380
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 1594 transition count 3380
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 1592 transition count 3378
Applied a total of 24 rules in 481 ms. Remains 1592 /1604 variables (removed 12) and now considering 3378/3390 (removed 12) transitions.
Running 3367 sub problems to find dead transitions.
[2024-06-01 16:36:40] [INFO ] Flow matrix only has 3369 transitions (discarded 9 similar events)
// Phase 1: matrix 3369 rows 1592 cols
[2024-06-01 16:36:40] [INFO ] Computed 182 invariants in 146 ms
[2024-06-01 16:36:40] [INFO ] State equation strengthened by 1 read => feed constraints.
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="PolyORBNT-COL-S10J80"
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 PolyORBNT-COL-S10J80, 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 r516-tajo-171654447100433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 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 ;