About the Execution of GreatSPN+red for PolyORBLF-COL-S04J04T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.071 | 3600000.00 | 13632813.00 | 2819.00 | F??FF?TTT??F?FTT | 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.r289-tajo-171654445200129.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S04J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200129
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S04J04T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716849351455
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:35:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 22:35:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:35:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 22:35:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:35:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 783 ms
[2024-05-27 22:35:53] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 712 PT places and 4080.0 transition bindings in 44 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2024-05-27 22:35:53] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 18 ms.
[2024-05-27 22:35:53] [INFO ] Skeletonized 16 HLPN properties in 4 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 40000 steps (20 resets) in 2310 ms. (17 steps per ms) remains 50/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 110 ms. (36 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 72 ms. (54 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 77 ms. (51 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
[2024-05-27 22:35:55] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:35:55] [INFO ] Computed 26 invariants in 7 ms
[2024-05-27 22:35:55] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp40 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 46 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 3 (OVERLAPS) 20/68 variables, 9/11 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 3/14 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 30 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 6 (OVERLAPS) 11/79 variables, 11/25 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 47 solved, 2 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 47 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/46 variables, 5/5 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/51 variables, 4/9 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 47 solved, 2 unsolved
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp49 is UNSAT
After SMT solving in domain Int declared 73/145 variables, and 21 constraints, problems are : Problem set: 49 solved, 0 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 925ms problems are : Problem set: 49 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 49 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:35:56] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-27 22:35:56] [INFO ] Flatten gal took : 28 ms
[2024-05-27 22:35:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:35:56] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:35:56] [INFO ] Unfolded HLPN to a Petri net with 712 places and 4012 transitions 27744 arcs in 100 ms.
[2024-05-27 22:35:56] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 349 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Applied a total of 4 rules in 62 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 22:35:56] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-05-27 22:35:56] [INFO ] Computed 50 invariants in 82 ms
[2024-05-27 22:35:56] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-27 22:36:23] [INFO ] Deduced a trap composed of 75 places in 170 ms of which 21 ms to minimize.
[2024-05-27 22:36:23] [INFO ] Deduced a trap composed of 75 places in 198 ms of which 2 ms to minimize.
[2024-05-27 22:36:23] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 1 ms to minimize.
[2024-05-27 22:36:23] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 2 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 75 places in 287 ms of which 1 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:36:25] [INFO ] Deduced a trap composed of 217 places in 440 ms of which 23 ms to minimize.
(s21 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 53 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-27 22:36:29] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
[2024-05-27 22:36:30] [INFO ] Deduced a trap composed of 368 places in 374 ms of which 4 ms to minimize.
[2024-05-27 22:36:39] [INFO ] Deduced a trap composed of 429 places in 361 ms of which 4 ms to minimize.
[2024-05-27 22:36:40] [INFO ] Deduced a trap composed of 433 places in 338 ms of which 4 ms to minimize.
[2024-05-27 22:36:40] [INFO ] Deduced a trap composed of 433 places in 366 ms of which 5 ms to minimize.
[2024-05-27 22:36:40] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 59 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 14/14 constraints]
After SMT, in 49453ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 49519ms
[2024-05-27 22:36:46] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-27 22:36:46] [INFO ] Invariant cache hit.
[2024-05-27 22:36:46] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-27 22:36:46] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-27 22:36:46] [INFO ] Invariant cache hit.
[2024-05-27 22:36:47] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 22:36:56] [INFO ] Implicit Places using invariants and state equation in 9755 ms returned []
Implicit Place search using SMT with State Equation took 10165 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 22:36:56] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-27 22:36:56] [INFO ] Invariant cache hit.
[2024-05-27 22:36:56] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-27 22:37:24] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:37:26] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:37:26] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 0 ms to minimize.
[2024-05-27 22:37:26] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:37:26] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:37:26] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 0 ms to minimize.
[2024-05-27 22:37:26] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:37:28] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 2 ms to minimize.
[2024-05-27 22:37:32] [INFO ] Deduced a trap composed of 395 places in 450 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 54 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-27 22:37:37] [INFO ] Deduced a trap composed of 156 places in 411 ms of which 4 ms to minimize.
[2024-05-27 22:37:38] [INFO ] Deduced a trap composed of 212 places in 416 ms of which 4 ms to minimize.
[2024-05-27 22:37:38] [INFO ] Deduced a trap composed of 219 places in 355 ms of which 3 ms to minimize.
[2024-05-27 22:37:38] [INFO ] Deduced a trap composed of 212 places in 338 ms of which 4 ms to minimize.
[2024-05-27 22:37:39] [INFO ] Deduced a trap composed of 214 places in 354 ms of which 5 ms to minimize.
[2024-05-27 22:37:39] [INFO ] Deduced a trap composed of 213 places in 329 ms of which 4 ms to minimize.
[2024-05-27 22:37:40] [INFO ] Deduced a trap composed of 360 places in 319 ms of which 4 ms to minimize.
[2024-05-27 22:37:52] [INFO ] Deduced a trap composed of 351 places in 353 ms of which 3 ms to minimize.
[2024-05-27 22:37:52] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 63 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 18/18 constraints]
After SMT, in 68482ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 68514ms
Starting structural reductions in LTL mode, iteration 1 : 708/712 places, 1844/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128298 ms. Remains : 708/712 places, 1844/1844 transitions.
Support contains 349 out of 708 places after structural reductions.
[2024-05-27 22:38:05] [INFO ] Flatten gal took : 308 ms
[2024-05-27 22:38:05] [INFO ] Flatten gal took : 182 ms
[2024-05-27 22:38:06] [INFO ] Input system was already deterministic with 1844 transitions.
RANDOM walk for 40000 steps (8 resets) in 1120 ms. (35 steps per ms) remains 19/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 135 ms. (29 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
[2024-05-27 22:38:06] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-27 22:38:06] [INFO ] Invariant cache hit.
[2024-05-27 22:38:06] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 82/297 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 16 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 1/6 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 12/309 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 6 (OVERLAPS) 383/692 variables, 28/38 constraints. Problems are: Problem set: 15 solved, 4 unsolved
[2024-05-27 22:38:07] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 2 ms to minimize.
[2024-05-27 22:38:07] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-27 22:38:07] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 14 ms to minimize.
[2024-05-27 22:38:08] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:38:08] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/692 variables, 5/43 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/692 variables, 0/43 constraints. Problems are: Problem set: 15 solved, 4 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 9 (OVERLAPS) 2/694 variables, 2/45 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/694 variables, 0/45 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/706 variables, 9/54 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/706 variables, 0/54 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1812/2518 variables, 706/760 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2518 variables, 160/920 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2518 variables, 0/920 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/2520 variables, 2/922 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2520 variables, 1/923 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2520 variables, 0/923 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2520 variables, 0/923 constraints. Problems are: Problem set: 17 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2520/2520 variables, and 923 constraints, problems are : Problem set: 17 solved, 2 unsolved in 3912 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 708/708 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 17 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/66 variables, 1/1 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 617/683 variables, 28/29 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 5/34 constraints. Problems are: Problem set: 17 solved, 2 unsolved
[2024-05-27 22:38:12] [INFO ] Deduced a trap composed of 76 places in 1084 ms of which 1 ms to minimize.
[2024-05-27 22:38:12] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/683 variables, 2/36 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/683 variables, 0/36 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/693 variables, 10/46 constraints. Problems are: Problem set: 17 solved, 2 unsolved
[2024-05-27 22:38:12] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/693 variables, 1/47 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/693 variables, 0/47 constraints. Problems are: Problem set: 17 solved, 2 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 10 (OVERLAPS) 13/706 variables, 10/57 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/706 variables, 0/57 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1812/2518 variables, 706/763 constraints. Problems are: Problem set: 18 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2518/2520 variables, and 923 constraints, problems are : Problem set: 18 solved, 1 unsolved in 3652 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 706/708 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 8/8 constraints]
After SMT, in 7716ms problems are : Problem set: 18 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 636 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 144 place count 636 transition count 1692
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 304 place count 556 transition count 1692
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 448 place count 484 transition count 1620
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 464 place count 484 transition count 1604
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 480 place count 468 transition count 1604
Applied a total of 480 rules in 250 ms. Remains 468 /708 variables (removed 240) and now considering 1604/1844 (removed 240) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-27 22:38:14] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
// Phase 1: matrix 1572 rows 468 cols
[2024-05-27 22:38:14] [INFO ] Computed 50 invariants in 52 ms
[2024-05-27 22:38:15] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-27 22:38:38] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:38:38] [INFO ] Deduced a trap composed of 45 places in 656 ms of which 2 ms to minimize.
[2024-05-27 22:38:39] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:38:39] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
[2024-05-27 22:38:39] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:38:39] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:38:39] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:38:39] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2024-05-27 22:38:39] [INFO ] Deduced a trap composed of 199 places in 349 ms of which 3 ms to minimize.
[2024-05-27 22:38:40] [INFO ] Deduced a trap composed of 193 places in 430 ms of which 3 ms to minimize.
[2024-05-27 22:38:42] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2040 variables, and 57 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/35 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-27 22:39:00] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 2 ms to minimize.
[2024-05-27 22:39:00] [INFO ] Deduced a trap composed of 180 places in 279 ms of which 3 ms to minimize.
[2024-05-27 22:39:00] [INFO ] Deduced a trap composed of 170 places in 275 ms of which 3 ms to minimize.
[2024-05-27 22:39:01] [INFO ] Deduced a trap composed of 158 places in 295 ms of which 3 ms to minimize.
[2024-05-27 22:39:01] [INFO ] Deduced a trap composed of 167 places in 286 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2040 variables, and 62 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/35 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 16/16 constraints]
After SMT, in 51075ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 51092ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51347 ms. Remains : 468/708 places, 1604/1844 transitions.
RANDOM walk for 34510 steps (7 resets) in 533 ms. (64 steps per ms) remains 0/1 properties
Successfully simplified 18 atomic propositions for a total of 7 simplifications.
[2024-05-27 22:39:06] [INFO ] Flatten gal took : 161 ms
[2024-05-27 22:39:06] [INFO ] Flatten gal took : 136 ms
[2024-05-27 22:39:06] [INFO ] Input system was already deterministic with 1844 transitions.
Support contains 155 out of 708 places (down from 224) after GAL structural reductions.
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 708/708 places, 1844/1844 transitions.
Applied a total of 0 rules in 17 ms. Remains 708 /708 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 22:39:06] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-05-27 22:39:06] [INFO ] Computed 50 invariants in 41 ms
[2024-05-27 22:39:06] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-27 22:39:30] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 1 ms to minimize.
[2024-05-27 22:39:30] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-27 22:39:30] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:39:30] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:39:30] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:39:31] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 0 ms to minimize.
[2024-05-27 22:39:31] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:39:31] [INFO ] Deduced a trap composed of 217 places in 356 ms of which 4 ms to minimize.
[2024-05-27 22:39:33] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
(s507 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 9.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 4.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 54 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-27 22:39:38] [INFO ] Deduced a trap composed of 360 places in 378 ms of which 4 ms to minimize.
[2024-05-27 22:39:46] [INFO ] Deduced a trap composed of 412 places in 321 ms of which 4 ms to minimize.
[2024-05-27 22:39:46] [INFO ] Deduced a trap composed of 370 places in 321 ms of which 4 ms to minimize.
[2024-05-27 22:39:47] [INFO ] Deduced a trap composed of 428 places in 352 ms of which 4 ms to minimize.
[2024-05-27 22:39:47] [INFO ] Deduced a trap composed of 461 places in 309 ms of which 4 ms to minimize.
[2024-05-27 22:39:47] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 3 ms to minimize.
[2024-05-27 22:39:48] [INFO ] Deduced a trap composed of 381 places in 318 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 61 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 16/16 constraints]
After SMT, in 49029ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 49047ms
Finished structural reductions in LTL mode , in 1 iterations and 49068 ms. Remains : 708/708 places, 1844/1844 transitions.
[2024-05-27 22:39:55] [INFO ] Flatten gal took : 81 ms
[2024-05-27 22:39:55] [INFO ] Flatten gal took : 75 ms
[2024-05-27 22:39:56] [INFO ] Input system was already deterministic with 1844 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 708/708 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 636 transition count 1772
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 144 place count 636 transition count 1724
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 240 place count 588 transition count 1724
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 400 place count 508 transition count 1644
Applied a total of 400 rules in 151 ms. Remains 508 /708 variables (removed 200) and now considering 1644/1844 (removed 200) transitions.
Running 1640 sub problems to find dead transitions.
[2024-05-27 22:39:56] [INFO ] Flow matrix only has 1612 transitions (discarded 32 similar events)
// Phase 1: matrix 1612 rows 508 cols
[2024-05-27 22:39:56] [INFO ] Computed 50 invariants in 22 ms
[2024-05-27 22:39:56] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)timeout
(s26 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
SMT process timed out in 29094ms, After SMT, problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 29113ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 29269 ms. Remains : 508/708 places, 1644/1844 transitions.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBLF-COL-S04J04T08
IS_COLORED=1
IS_NUPN=
LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 81
TRANSITIONS: 65
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 6
COLOR VARS: 25
ARCS: 254
LOADING TIME: 0.512
UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 712
TRANSITIONS: 4012
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 27744
UNFOLDING TIME: 0.984
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.322
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 2.162
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 913
MODEL NAME: /home/mcc/execution/model
712 places, 4012 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
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="PolyORBLF-COL-S04J04T08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S04J04T08, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445200129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J04T08.tgz
mv PolyORBLF-COL-S04J04T08 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 ;