fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r223-tall-171649610600042
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for JoinFreeModules-PT-0050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9109.264 1057361.00 2491370.00 1772.80 FT?FT?F?FFFFTTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649610600042.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is JoinFreeModules-PT-0050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610600042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 152K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-00
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-01
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-02
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-03
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-04
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-05
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-06
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-07
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-08
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-09
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-10
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2024-11
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2023-12
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2023-13
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2023-14
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716498021128

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 21:00:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 21:00:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:00:22] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-23 21:00:22] [INFO ] Transformed 251 places.
[2024-05-23 21:00:22] [INFO ] Transformed 401 transitions.
[2024-05-23 21:00:22] [INFO ] Parsed PT model containing 251 places and 401 transitions and 1152 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Initial state reduction rules removed 6 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 18 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
// Phase 1: matrix 401 rows 250 cols
[2024-05-23 21:00:22] [INFO ] Computed 50 invariants in 29 ms
[2024-05-23 21:00:22] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 15457 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:00:42] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 9 ms to minimize.
[2024-05-23 21:00:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 5 ms to minimize.
[2024-05-23 21:00:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 3/653 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:00:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2024-05-23 21:00:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 21:00:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-23 21:00:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 21:00:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 5/658 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 658 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints]
After SMT, in 35644ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 35664ms
[2024-05-23 21:00:58] [INFO ] Invariant cache hit.
[2024-05-23 21:00:58] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-23 21:00:58] [INFO ] Invariant cache hit.
[2024-05-23 21:00:58] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-23 21:00:58] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-23 21:00:58] [INFO ] Invariant cache hit.
[2024-05-23 21:00:58] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14661 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:01:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 21:01:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 21:01:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-23 21:01:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 21:01:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 21:01:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:01:30] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-23 21:01:30] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 21:01:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:01:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44727ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44730ms
Finished structural reductions in LTL mode , in 1 iterations and 80652 ms. Remains : 250/250 places, 401/401 transitions.
Support contains 55 out of 250 places after structural reductions.
[2024-05-23 21:01:43] [INFO ] Flatten gal took : 51 ms
[2024-05-23 21:01:43] [INFO ] Flatten gal took : 23 ms
[2024-05-23 21:01:43] [INFO ] Input system was already deterministic with 401 transitions.
Support contains 53 out of 250 places (down from 55) after GAL structural reductions.
RANDOM walk for 40006 steps (8 resets) in 716 ms. (55 steps per ms) remains 0/39 properties
[2024-05-23 21:01:43] [INFO ] Flatten gal took : 19 ms
[2024-05-23 21:01:43] [INFO ] Flatten gal took : 17 ms
[2024-05-23 21:01:43] [INFO ] Input system was already deterministic with 401 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 47 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-05-23 21:01:43] [INFO ] Invariant cache hit.
[2024-05-23 21:01:43] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14683 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:02:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-23 21:02:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 21:02:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-23 21:02:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:02:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 21:02:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:02:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-23 21:02:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:02:16] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34753ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34758ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 34806 ms. Remains : 250/250 places, 401/401 transitions.
[2024-05-23 21:02:18] [INFO ] Flatten gal took : 19 ms
[2024-05-23 21:02:18] [INFO ] Flatten gal took : 13 ms
[2024-05-23 21:02:18] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-05-23 21:02:18] [INFO ] Invariant cache hit.
[2024-05-23 21:02:18] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14568 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:02:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:02:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 21:02:41] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-23 21:02:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:02:41] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:02:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:02:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-23 21:02:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2024-05-23 21:02:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34625ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34627ms
Finished structural reductions in LTL mode , in 1 iterations and 34640 ms. Remains : 250/250 places, 401/401 transitions.
[2024-05-23 21:02:53] [INFO ] Flatten gal took : 22 ms
[2024-05-23 21:02:53] [INFO ] Flatten gal took : 13 ms
[2024-05-23 21:02:53] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 20 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-05-23 21:02:53] [INFO ] Invariant cache hit.
[2024-05-23 21:02:53] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14396 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:03:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 21:03:12] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 21:03:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:03:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 21:03:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:03:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:03:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-23 21:03:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-23 21:03:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34455ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34458ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 34480 ms. Remains : 250/250 places, 401/401 transitions.
[2024-05-23 21:03:27] [INFO ] Flatten gal took : 20 ms
[2024-05-23 21:03:27] [INFO ] Flatten gal took : 11 ms
[2024-05-23 21:03:28] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-05-23 21:03:28] [INFO ] Invariant cache hit.
[2024-05-23 21:03:28] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14472 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:03:47] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 21:03:47] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 21:03:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-23 21:03:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 21:03:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-23 21:03:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:04:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 21:04:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 21:04:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34531ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34533ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 34547 ms. Remains : 250/250 places, 401/401 transitions.
[2024-05-23 21:04:02] [INFO ] Flatten gal took : 12 ms
[2024-05-23 21:04:02] [INFO ] Flatten gal took : 11 ms
[2024-05-23 21:04:02] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-05-23 21:04:02] [INFO ] Invariant cache hit.
[2024-05-23 21:04:02] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14519 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:04:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 21:04:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 21:04:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-23 21:04:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 21:04:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-23 21:04:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:04:34] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 21:04:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:04:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34564ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34566ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 34580 ms. Remains : 250/250 places, 401/401 transitions.
[2024-05-23 21:04:37] [INFO ] Flatten gal took : 18 ms
[2024-05-23 21:04:37] [INFO ] Flatten gal took : 13 ms
[2024-05-23 21:04:37] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-05-23 21:04:37] [INFO ] Invariant cache hit.
[2024-05-23 21:04:37] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14558 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:04:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 21:04:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-23 21:04:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2024-05-23 21:04:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:04:59] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 21:04:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:05:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-23 21:05:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 21:05:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34610ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34613ms
Finished structural reductions in LTL mode , in 1 iterations and 34619 ms. Remains : 250/250 places, 401/401 transitions.
[2024-05-23 21:05:11] [INFO ] Flatten gal took : 15 ms
[2024-05-23 21:05:11] [INFO ] Flatten gal took : 12 ms
[2024-05-23 21:05:11] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-05-23 21:05:11] [INFO ] Invariant cache hit.
[2024-05-23 21:05:11] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14344 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:05:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:05:30] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-23 21:05:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 21:05:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:05:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 21:05:33] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:05:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 21:05:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-23 21:05:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34389ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34392ms
Finished structural reductions in LTL mode , in 1 iterations and 34395 ms. Remains : 250/250 places, 401/401 transitions.
[2024-05-23 21:05:46] [INFO ] Flatten gal took : 13 ms
[2024-05-23 21:05:46] [INFO ] Flatten gal took : 9 ms
[2024-05-23 21:05:46] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-05-23 21:05:46] [INFO ] Invariant cache hit.
[2024-05-23 21:05:46] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14419 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:06:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 21:06:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-23 21:06:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:06:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 21:06:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:06:08] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:06:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-23 21:06:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-23 21:06:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34473ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34475ms
Finished structural reductions in LTL mode , in 1 iterations and 34478 ms. Remains : 250/250 places, 401/401 transitions.
[2024-05-23 21:06:20] [INFO ] Flatten gal took : 9 ms
[2024-05-23 21:06:20] [INFO ] Flatten gal took : 9 ms
[2024-05-23 21:06:20] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-05-23 21:06:20] [INFO ] Invariant cache hit.
[2024-05-23 21:06:20] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14119 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:06:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2024-05-23 21:06:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 21:06:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:06:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:06:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 21:06:42] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:06:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 21:06:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 21:06:52] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34176ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34179ms
Finished structural reductions in LTL mode , in 1 iterations and 34195 ms. Remains : 250/250 places, 401/401 transitions.
[2024-05-23 21:06:55] [INFO ] Flatten gal took : 21 ms
[2024-05-23 21:06:55] [INFO ] Flatten gal took : 8 ms
[2024-05-23 21:06:55] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-05-23 21:06:55] [INFO ] Invariant cache hit.
[2024-05-23 21:06:55] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14318 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:07:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-23 21:07:13] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 21:07:16] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:07:16] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 21:07:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:07:16] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-23 21:07:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-23 21:07:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:07:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34368ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34373ms
Finished structural reductions in LTL mode , in 1 iterations and 34375 ms. Remains : 250/250 places, 401/401 transitions.
[2024-05-23 21:07:29] [INFO ] Flatten gal took : 8 ms
[2024-05-23 21:07:29] [INFO ] Flatten gal took : 7 ms
[2024-05-23 21:07:29] [INFO ] Input system was already deterministic with 401 transitions.
[2024-05-23 21:07:29] [INFO ] Flatten gal took : 7 ms
[2024-05-23 21:07:29] [INFO ] Flatten gal took : 7 ms
[2024-05-23 21:07:29] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-23 21:07:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 401 transitions and 1150 arcs took 4 ms.
Total runtime 427283 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running JoinFreeModules-PT-0050

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 250
TRANSITIONS: 401
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 966
MODEL NAME: /home/mcc/execution/411/model
250 places, 401 transitions.

Creating all event NSFs..
Creating all event NSFs..
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.
Building monolithic NSF...
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0050-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0050-CTLFireability-2024-07 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716499078489

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="JoinFreeModules-PT-0050"
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 JoinFreeModules-PT-0050, 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 r223-tall-171649610600042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0050.tgz
mv JoinFreeModules-PT-0050 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 ;