fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445700330
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-PT-S06J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13053.995 3600000.00 11963499.00 277.60 ???T?????T?????T 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-171654445700330.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-PT-S06J04T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 18K Apr 11 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 443K Apr 11 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 11 17:11 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 17K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 268K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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-PT-S06J04T08-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716870929330

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:35:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 04:35:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:35:31] [INFO ] Load time of PNML (sax parser for PT used): 663 ms
[2024-05-28 04:35:31] [INFO ] Transformed 810 places.
[2024-05-28 04:35:31] [INFO ] Transformed 14014 transitions.
[2024-05-28 04:35:31] [INFO ] Parsed PT model containing 810 places and 14014 transitions and 118428 arcs in 927 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 125 ms.
[2024-05-28 04:35:31] [INFO ] Reduced 9360 identical enabling conditions.
[2024-05-28 04:35:31] [INFO ] Reduced 120 identical enabling conditions.
[2024-05-28 04:35:31] [INFO ] Reduced 9360 identical enabling conditions.
[2024-05-28 04:35:31] [INFO ] Reduced 120 identical enabling conditions.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Support contains 583 out of 810 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 810/810 places, 3254/3254 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 802 transition count 3246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 802 transition count 3246
Applied a total of 16 rules in 180 ms. Remains 802 /810 variables (removed 8) and now considering 3246/3254 (removed 8) transitions.
Running 3240 sub problems to find dead transitions.
[2024-05-28 04:35:32] [INFO ] Flow matrix only has 3198 transitions (discarded 48 similar events)
// Phase 1: matrix 3198 rows 802 cols
[2024-05-28 04:35:32] [INFO ] Computed 58 invariants in 291 ms
[2024-05-28 04:35:32] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/790 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 46368ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 46438ms
[2024-05-28 04:36:18] [INFO ] Flow matrix only has 3198 transitions (discarded 48 similar events)
[2024-05-28 04:36:18] [INFO ] Invariant cache hit.
[2024-05-28 04:36:19] [INFO ] Implicit Places using invariants in 399 ms returned [49, 73, 224, 285, 334, 495, 505, 787]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 424 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 794/810 places, 3246/3254 transitions.
Applied a total of 0 rules in 36 ms. Remains 794 /794 variables (removed 0) and now considering 3246/3246 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47164 ms. Remains : 794/810 places, 3246/3254 transitions.
Support contains 583 out of 794 places after structural reductions.
[2024-05-28 04:36:19] [INFO ] Flatten gal took : 440 ms
[2024-05-28 04:36:20] [INFO ] Flatten gal took : 291 ms
[2024-05-28 04:36:21] [INFO ] Input system was already deterministic with 3246 transitions.
Reduction of identical properties reduced properties to check from 88 to 87
RANDOM walk for 40000 steps (273 resets) in 4331 ms. (9 steps per ms) remains 39/87 properties
BEST_FIRST walk for 4003 steps (11 resets) in 347 ms. (11 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (16 resets) in 194 ms. (20 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (116 resets) in 187 ms. (21 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (15 resets) in 72 ms. (54 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 55 ms. (71 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (11 resets) in 50 ms. (78 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (20 resets) in 50 ms. (78 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (9 resets) in 44 ms. (88 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (23 resets) in 45 ms. (87 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 47 ms. (83 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (9 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (9 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (12 resets) in 35 ms. (111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 373 ms. (10 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (19 resets) in 51 ms. (77 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 36 ms. (108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (9 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 38/38 properties
[2024-05-28 04:36:23] [INFO ] Flow matrix only has 3198 transitions (discarded 48 similar events)
// Phase 1: matrix 3198 rows 794 cols
[2024-05-28 04:36:24] [INFO ] Computed 50 invariants in 119 ms
[2024-05-28 04:36:24] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 151/469 variables, 12/16 constraints. Problems are: Problem set: 19 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/16 constraints. Problems are: Problem set: 19 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 18/487 variables, 5/21 constraints. Problems are: Problem set: 19 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 0/21 constraints. Problems are: Problem set: 19 solved, 19 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 7 (OVERLAPS) 304/791 variables, 27/48 constraints. Problems are: Problem set: 30 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/791 variables, 0/48 constraints. Problems are: Problem set: 30 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/792 variables, 1/49 constraints. Problems are: Problem set: 30 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 0/49 constraints. Problems are: Problem set: 30 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 3198/3990 variables, 792/841 constraints. Problems are: Problem set: 30 solved, 8 unsolved
SMT process timed out in 6410ms, After SMT, problems are : Problem set: 30 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 788 transition count 3198
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 102 place count 740 transition count 3198
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 102 place count 740 transition count 3102
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 294 place count 644 transition count 3102
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 502 place count 540 transition count 2998
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 506 place count 536 transition count 2994
Iterating global reduction 2 with 4 rules applied. Total rules applied 510 place count 536 transition count 2994
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 527 place count 536 transition count 2977
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 544 place count 519 transition count 2977
Applied a total of 544 rules in 480 ms. Remains 519 /794 variables (removed 275) and now considering 2977/3246 (removed 269) transitions.
Running 2971 sub problems to find dead transitions.
[2024-05-28 04:36:30] [INFO ] Flow matrix only has 2929 transitions (discarded 48 similar events)
// Phase 1: matrix 2929 rows 519 cols
[2024-05-28 04:36:31] [INFO ] Computed 44 invariants in 111 ms
[2024-05-28 04:36:31] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 2971 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/3448 variables, and 33 constraints, problems are : Problem set: 0 solved, 2971 unsolved in 20086 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/519 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 2971/1291 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2971 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 2971 unsolved
[2024-05-28 04:37:29] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 22 ms to minimize.
[2024-05-28 04:37:30] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 3 ms to minimize.
[2024-05-28 04:37:31] [INFO ] Deduced a trap composed of 52 places in 704 ms of which 5 ms to minimize.
[2024-05-28 04:37:32] [INFO ] Deduced a trap composed of 44 places in 613 ms of which 4 ms to minimize.
[2024-05-28 04:37:32] [INFO ] Deduced a trap composed of 51 places in 375 ms of which 3 ms to minimize.
[2024-05-28 04:37:33] [INFO ] Deduced a trap composed of 44 places in 380 ms of which 5 ms to minimize.
[2024-05-28 04:37:33] [INFO ] Deduced a trap composed of 51 places in 387 ms of which 3 ms to minimize.
[2024-05-28 04:37:34] [INFO ] Deduced a trap composed of 34 places in 410 ms of which 3 ms to minimize.
[2024-05-28 04:37:34] [INFO ] Deduced a trap composed of 52 places in 640 ms of which 2 ms to minimize.
[2024-05-28 04:37:34] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-05-28 04:37:43] [INFO ] Deduced a trap composed of 51 places in 752 ms of which 3 ms to minimize.
[2024-05-28 04:37:43] [INFO ] Deduced a trap composed of 52 places in 601 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/3448 variables, and 45 constraints, problems are : Problem set: 0 solved, 2971 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/519 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1680/1291 constraints, Known Traps: 12/12 constraints]
After SMT, in 77086ms problems are : Problem set: 0 solved, 2971 unsolved
Search for dead transitions found 0 dead transitions in 77132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77622 ms. Remains : 519/794 places, 2977/3246 transitions.
RANDOM walk for 40000 steps (475 resets) in 1612 ms. (24 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (42 resets) in 289 ms. (137 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (38 resets) in 290 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (60 resets) in 280 ms. (142 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 248 ms. (160 steps per ms) remains 2/3 properties
[2024-05-28 04:37:48] [INFO ] Flow matrix only has 2929 transitions (discarded 48 similar events)
[2024-05-28 04:37:48] [INFO ] Invariant cache hit.
[2024-05-28 04:37:48] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/85 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 83/168 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 328/496 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/502 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/517 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/517 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2929/3446 variables, 517/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3446 variables, 224/784 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3446 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3448 variables, 2/786 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3448 variables, 1/787 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3448 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/3448 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3448/3448 variables, and 787 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6936 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 519/519 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/85 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 83/168 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 328/496 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 04:37:56] [INFO ] Deduced a trap composed of 51 places in 262 ms of which 3 ms to minimize.
[2024-05-28 04:37:56] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 2 ms to minimize.
[2024-05-28 04:37:56] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 1 ms to minimize.
[2024-05-28 04:37:56] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 1 ms to minimize.
[2024-05-28 04:37:57] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2024-05-28 04:37:57] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-05-28 04:37:57] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/502 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/502 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 15/517 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/517 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2929/3446 variables, 517/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3446 variables, 224/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3446 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3448 variables, 2/793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3448 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3448 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/3448 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3448/3448 variables, and 794 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8666 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 519/519 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 7/7 constraints]
After SMT, in 15668ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 346 ms.
Support contains 8 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 2977/2977 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 519 transition count 2972
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 514 transition count 2972
Applied a total of 10 rules in 240 ms. Remains 514 /519 variables (removed 5) and now considering 2972/2977 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 514/519 places, 2972/2977 transitions.
Successfully simplified 30 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S06J04T08-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 04:38:05] [INFO ] Flatten gal took : 260 ms
[2024-05-28 04:38:05] [INFO ] Flatten gal took : 236 ms
[2024-05-28 04:38:06] [INFO ] Input system was already deterministic with 3246 transitions.
Support contains 504 out of 794 places (down from 506) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 788 transition count 3206
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 748 transition count 3198
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 740 transition count 3198
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 96 place count 740 transition count 3094
Deduced a syphon composed of 104 places in 3 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 304 place count 636 transition count 3094
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 368 place count 604 transition count 3062
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 372 place count 600 transition count 3058
Iterating global reduction 3 with 4 rules applied. Total rules applied 376 place count 600 transition count 3058
Applied a total of 376 rules in 283 ms. Remains 600 /794 variables (removed 194) and now considering 3058/3246 (removed 188) transitions.
Running 3052 sub problems to find dead transitions.
[2024-05-28 04:38:06] [INFO ] Flow matrix only has 3010 transitions (discarded 48 similar events)
// Phase 1: matrix 3010 rows 600 cols
[2024-05-28 04:38:07] [INFO ] Computed 44 invariants in 114 ms
[2024-05-28 04:38:07] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3052 unsolved
SMT process timed out in 52422ms, After SMT, problems are : Problem set: 0 solved, 3052 unsolved
Search for dead transitions found 0 dead transitions in 52460ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 52755 ms. Remains : 600/794 places, 3058/3246 transitions.
[2024-05-28 04:38:59] [INFO ] Flatten gal took : 209 ms
[2024-05-28 04:38:59] [INFO ] Flatten gal took : 284 ms
[2024-05-28 04:39:00] [INFO ] Input system was already deterministic with 3058 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 788 transition count 3214
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 756 transition count 3214
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 64 place count 756 transition count 3118
Deduced a syphon composed of 96 places in 8 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 256 place count 660 transition count 3118
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 448 place count 564 transition count 3022
Applied a total of 448 rules in 232 ms. Remains 564 /794 variables (removed 230) and now considering 3022/3246 (removed 224) transitions.
Running 3016 sub problems to find dead transitions.
[2024-05-28 04:39:00] [INFO ] Flow matrix only has 2974 transitions (discarded 48 similar events)
// Phase 1: matrix 2974 rows 564 cols
[2024-05-28 04:39:00] [INFO ] Computed 44 invariants in 47 ms
[2024-05-28 04:39:00] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3016 unsolved
SMT process timed out in 52055ms, After SMT, problems are : Problem set: 0 solved, 3016 unsolved
Search for dead transitions found 0 dead transitions in 52100ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 52342 ms. Remains : 564/794 places, 3022/3246 transitions.
[2024-05-28 04:39:52] [INFO ] Flatten gal took : 141 ms
[2024-05-28 04:39:52] [INFO ] Flatten gal took : 220 ms
[2024-05-28 04:39:53] [INFO ] Input system was already deterministic with 3022 transitions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 788 transition count 3246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 780 transition count 3238
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 780 transition count 3238
Applied a total of 22 rules in 91 ms. Remains 780 /794 variables (removed 14) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 04:39:53] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
// Phase 1: matrix 3190 rows 780 cols
[2024-05-28 04:39:53] [INFO ] Computed 44 invariants in 120 ms
[2024-05-28 04:39:53] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 51681ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 51722ms
Finished structural reductions in LTL mode , in 1 iterations and 51824 ms. Remains : 780/794 places, 3238/3246 transitions.
[2024-05-28 04:40:45] [INFO ] Flatten gal took : 158 ms
[2024-05-28 04:40:45] [INFO ] Flatten gal took : 153 ms
[2024-05-28 04:40:45] [INFO ] Input system was already deterministic with 3238 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 788 transition count 3198
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 740 transition count 3198
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 96 place count 740 transition count 3102
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 288 place count 644 transition count 3102
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 496 place count 540 transition count 2998
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 500 place count 536 transition count 2994
Iterating global reduction 2 with 4 rules applied. Total rules applied 504 place count 536 transition count 2994
Applied a total of 504 rules in 207 ms. Remains 536 /794 variables (removed 258) and now considering 2994/3246 (removed 252) transitions.
Running 2988 sub problems to find dead transitions.
[2024-05-28 04:40:45] [INFO ] Flow matrix only has 2946 transitions (discarded 48 similar events)
// Phase 1: matrix 2946 rows 536 cols
[2024-05-28 04:40:46] [INFO ] Computed 44 invariants in 70 ms
[2024-05-28 04:40:46] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2988 unsolved
SMT process timed out in 53633ms, After SMT, problems are : Problem set: 0 solved, 2988 unsolved
Search for dead transitions found 0 dead transitions in 53664ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 53878 ms. Remains : 536/794 places, 2994/3246 transitions.
[2024-05-28 04:41:39] [INFO ] Flatten gal took : 126 ms
[2024-05-28 04:41:39] [INFO ] Flatten gal took : 137 ms
[2024-05-28 04:41:40] [INFO ] Input system was already deterministic with 2994 transitions.
RANDOM walk for 52 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S06J04T08-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 786 transition count 3238
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 786 transition count 3238
Applied a total of 16 rules in 92 ms. Remains 786 /794 variables (removed 8) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 04:41:40] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
// Phase 1: matrix 3190 rows 786 cols
[2024-05-28 04:41:40] [INFO ] Computed 50 invariants in 107 ms
[2024-05-28 04:41:40] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 48079ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 48117ms
Finished structural reductions in LTL mode , in 1 iterations and 48219 ms. Remains : 786/794 places, 3238/3246 transitions.
[2024-05-28 04:42:28] [INFO ] Flatten gal took : 122 ms
[2024-05-28 04:42:28] [INFO ] Flatten gal took : 162 ms
[2024-05-28 04:42:28] [INFO ] Input system was already deterministic with 3238 transitions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Applied a total of 0 rules in 24 ms. Remains 794 /794 variables (removed 0) and now considering 3246/3246 (removed 0) transitions.
Running 3240 sub problems to find dead transitions.
[2024-05-28 04:42:29] [INFO ] Flow matrix only has 3198 transitions (discarded 48 similar events)
// Phase 1: matrix 3198 rows 794 cols
[2024-05-28 04:42:29] [INFO ] Computed 50 invariants in 81 ms
[2024-05-28 04:42:29] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 56878ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 56907ms
Finished structural reductions in LTL mode , in 1 iterations and 56938 ms. Remains : 794/794 places, 3246/3246 transitions.
[2024-05-28 04:43:26] [INFO ] Flatten gal took : 128 ms
[2024-05-28 04:43:26] [INFO ] Flatten gal took : 133 ms
[2024-05-28 04:43:26] [INFO ] Input system was already deterministic with 3246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 788 transition count 3246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 780 transition count 3238
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 780 transition count 3238
Applied a total of 22 rules in 88 ms. Remains 780 /794 variables (removed 14) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 04:43:26] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
// Phase 1: matrix 3190 rows 780 cols
[2024-05-28 04:43:26] [INFO ] Computed 44 invariants in 114 ms
[2024-05-28 04:43:26] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 4.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 46692ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 46727ms
Finished structural reductions in LTL mode , in 1 iterations and 46823 ms. Remains : 780/794 places, 3238/3246 transitions.
[2024-05-28 04:44:13] [INFO ] Flatten gal took : 149 ms
[2024-05-28 04:44:13] [INFO ] Flatten gal took : 149 ms
[2024-05-28 04:44:14] [INFO ] Input system was already deterministic with 3238 transitions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 788 transition count 3246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 780 transition count 3238
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 780 transition count 3238
Applied a total of 22 rules in 66 ms. Remains 780 /794 variables (removed 14) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 04:44:14] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 04:44:14] [INFO ] Invariant cache hit.
[2024-05-28 04:44:14] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 47109ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 47139ms
Finished structural reductions in LTL mode , in 1 iterations and 47212 ms. Remains : 780/794 places, 3238/3246 transitions.
[2024-05-28 04:45:01] [INFO ] Flatten gal took : 116 ms
[2024-05-28 04:45:01] [INFO ] Flatten gal took : 154 ms
[2024-05-28 04:45:01] [INFO ] Input system was already deterministic with 3238 transitions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 788 transition count 3246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 780 transition count 3238
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 780 transition count 3238
Applied a total of 22 rules in 62 ms. Remains 780 /794 variables (removed 14) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 04:45:01] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 04:45:01] [INFO ] Invariant cache hit.
[2024-05-28 04:45:01] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 46827ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 46855ms
Finished structural reductions in LTL mode , in 1 iterations and 46924 ms. Remains : 780/794 places, 3238/3246 transitions.
[2024-05-28 04:45:48] [INFO ] Flatten gal took : 153 ms
[2024-05-28 04:45:49] [INFO ] Flatten gal took : 175 ms
[2024-05-28 04:45:49] [INFO ] Input system was already deterministic with 3238 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 788 transition count 3198
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 740 transition count 3198
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 96 place count 740 transition count 3102
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 288 place count 644 transition count 3102
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 496 place count 540 transition count 2998
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 500 place count 536 transition count 2994
Iterating global reduction 2 with 4 rules applied. Total rules applied 504 place count 536 transition count 2994
Applied a total of 504 rules in 199 ms. Remains 536 /794 variables (removed 258) and now considering 2994/3246 (removed 252) transitions.
Running 2988 sub problems to find dead transitions.
[2024-05-28 04:45:49] [INFO ] Flow matrix only has 2946 transitions (discarded 48 similar events)
// Phase 1: matrix 2946 rows 536 cols
[2024-05-28 04:45:49] [INFO ] Computed 44 invariants in 69 ms
[2024-05-28 04:45:49] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2988 unsolved
SMT process timed out in 46339ms, After SMT, problems are : Problem set: 0 solved, 2988 unsolved
Search for dead transitions found 0 dead transitions in 46367ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46573 ms. Remains : 536/794 places, 2994/3246 transitions.
[2024-05-28 04:46:36] [INFO ] Flatten gal took : 163 ms
[2024-05-28 04:46:36] [INFO ] Flatten gal took : 217 ms
[2024-05-28 04:46:36] [INFO ] Input system was already deterministic with 2994 transitions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 788 transition count 3246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 780 transition count 3238
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 780 transition count 3238
Applied a total of 22 rules in 88 ms. Remains 780 /794 variables (removed 14) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 04:46:36] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
// Phase 1: matrix 3190 rows 780 cols
[2024-05-28 04:46:36] [INFO ] Computed 44 invariants in 113 ms
[2024-05-28 04:46:36] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 53929ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 53964ms
Finished structural reductions in LTL mode , in 1 iterations and 54060 ms. Remains : 780/794 places, 3238/3246 transitions.
[2024-05-28 04:47:30] [INFO ] Flatten gal took : 117 ms
[2024-05-28 04:47:30] [INFO ] Flatten gal took : 127 ms
[2024-05-28 04:47:31] [INFO ] Input system was already deterministic with 3238 transitions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 789 transition count 3246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 13 place count 781 transition count 3238
Iterating global reduction 1 with 8 rules applied. Total rules applied 21 place count 781 transition count 3238
Applied a total of 21 rules in 66 ms. Remains 781 /794 variables (removed 13) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 04:47:31] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
// Phase 1: matrix 3190 rows 781 cols
[2024-05-28 04:47:31] [INFO ] Computed 45 invariants in 71 ms
[2024-05-28 04:47:31] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 47519ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 47550ms
Finished structural reductions in LTL mode , in 1 iterations and 47623 ms. Remains : 781/794 places, 3238/3246 transitions.
[2024-05-28 04:48:18] [INFO ] Flatten gal took : 120 ms
[2024-05-28 04:48:19] [INFO ] Flatten gal took : 130 ms
[2024-05-28 04:48:19] [INFO ] Input system was already deterministic with 3238 transitions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 788 transition count 3246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 780 transition count 3238
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 780 transition count 3238
Applied a total of 22 rules in 66 ms. Remains 780 /794 variables (removed 14) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 04:48:19] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
// Phase 1: matrix 3190 rows 780 cols
[2024-05-28 04:48:19] [INFO ] Computed 44 invariants in 90 ms
[2024-05-28 04:48:19] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 4.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 3.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 4.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 4.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 2.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 3.0)
(s182 1.0)
(s183 4.0)
(s184 1.0)
(s185 1.0)
(s186 9.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 2.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 4.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 3.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 10.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 4.0)
(s284 1.0)
(s285 4.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 0.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 0.0)
(s331 1.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 2.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 4.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 2.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s399 1.0)
(s400 10.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 4.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 3.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 47928ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 47959ms
Finished structural reductions in LTL mode , in 1 iterations and 48032 ms. Remains : 780/794 places, 3238/3246 transitions.
[2024-05-28 04:49:07] [INFO ] Flatten gal took : 148 ms
[2024-05-28 04:49:07] [INFO ] Flatten gal took : 143 ms
[2024-05-28 04:49:07] [INFO ] Input system was already deterministic with 3238 transitions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 3246/3246 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 788 transition count 3246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 780 transition count 3238
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 780 transition count 3238
Applied a total of 22 rules in 66 ms. Remains 780 /794 variables (removed 14) and now considering 3238/3246 (removed 8) transitions.
Running 3232 sub problems to find dead transitions.
[2024-05-28 04:49:08] [INFO ] Flow matrix only has 3190 transitions (discarded 48 similar events)
[2024-05-28 04:49:08] [INFO ] Invariant cache hit.
[2024-05-28 04:49:08] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/774 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3232 unsolved
SMT process timed out in 47405ms, After SMT, problems are : Problem set: 0 solved, 3232 unsolved
Search for dead transitions found 0 dead transitions in 47435ms
Finished structural reductions in LTL mode , in 1 iterations and 47509 ms. Remains : 780/794 places, 3238/3246 transitions.
[2024-05-28 04:49:55] [INFO ] Flatten gal took : 135 ms
[2024-05-28 04:49:55] [INFO ] Flatten gal took : 149 ms
[2024-05-28 04:49:55] [INFO ] Input system was already deterministic with 3238 transitions.
[2024-05-28 04:49:56] [INFO ] Flatten gal took : 155 ms
[2024-05-28 04:49:56] [INFO ] Flatten gal took : 160 ms
[2024-05-28 04:49:56] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 38 ms.
[2024-05-28 04:49:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 794 places, 3246 transitions and 19876 arcs took 20 ms.
Total runtime 866164 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J04T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 794
TRANSITIONS: 3246
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.112s, Sys 0.020s]


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.016s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 771
MODEL NAME: /home/mcc/execution/417/model
794 places, 3246 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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 CTLFireability -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-PT-S06J04T08"
export BK_EXAMINATION="CTLFireability"
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-PT-S06J04T08, examination is CTLFireability"
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-171654445700330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T08.tgz
mv PolyORBLF-PT-S06J04T08 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;