fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
320.399 11972.00 25880.00 47.90 TFTTFTTFFFTFFTFT 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-171649610500010.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-0004, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610500010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.8K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 11K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 13K 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-0004-CTLFireability-2024-00
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2024-01
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2024-02
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2024-03
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2024-04
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2024-05
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2024-06
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2024-07
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2024-08
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2024-09
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2024-10
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2024-11
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2023-12
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2023-13
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2023-14
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716497736173

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-0004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 20:55:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 20:55:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:55:37] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2024-05-23 20:55:37] [INFO ] Transformed 21 places.
[2024-05-23 20:55:37] [INFO ] Transformed 33 transitions.
[2024-05-23 20:55:37] [INFO ] Parsed PT model containing 21 places and 33 transitions and 94 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 6 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0004-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 9 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
// Phase 1: matrix 33 rows 20 cols
[2024-05-23 20:55:37] [INFO ] Computed 4 invariants in 6 ms
[2024-05-23 20:55:37] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:37] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 7 ms to minimize.
[2024-05-23 20:55:37] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-23 20:55:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 20:55:38] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 1229ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1244ms
[2024-05-23 20:55:38] [INFO ] Invariant cache hit.
[2024-05-23 20:55:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 20:55:38] [INFO ] Invariant cache hit.
[2024-05-23 20:55:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-23 20:55:38] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2024-05-23 20:55:38] [INFO ] Invariant cache hit.
[2024-05-23 20:55:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:38] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 20:55:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 20:55:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-23 20:55:39] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 649ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 650ms
Finished structural reductions in LTL mode , in 1 iterations and 2014 ms. Remains : 20/20 places, 33/33 transitions.
Support contains 20 out of 20 places after structural reductions.
[2024-05-23 20:55:39] [INFO ] Flatten gal took : 27 ms
[2024-05-23 20:55:39] [INFO ] Flatten gal took : 5 ms
[2024-05-23 20:55:39] [INFO ] Input system was already deterministic with 33 transitions.
RANDOM walk for 40000 steps (140 resets) in 1220 ms. (32 steps per ms) remains 1/37 properties
BEST_FIRST walk for 40002 steps (27 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
[2024-05-23 20:55:40] [INFO ] Invariant cache hit.
[2024-05-23 20:55:40] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Real declared 2/53 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/20 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2024-05-23 20:55:40] [INFO ] Flatten gal took : 6 ms
[2024-05-23 20:55:40] [INFO ] Flatten gal took : 3 ms
[2024-05-23 20:55:40] [INFO ] Input system was already deterministic with 33 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
[2024-05-23 20:55:40] [INFO ] Invariant cache hit.
[2024-05-23 20:55:40] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:40] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-23 20:55:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 20:55:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-23 20:55:40] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 724ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 725ms
Finished structural reductions in LTL mode , in 1 iterations and 726 ms. Remains : 20/20 places, 33/33 transitions.
[2024-05-23 20:55:41] [INFO ] Flatten gal took : 6 ms
[2024-05-23 20:55:41] [INFO ] Flatten gal took : 3 ms
[2024-05-23 20:55:41] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
[2024-05-23 20:55:41] [INFO ] Invariant cache hit.
[2024-05-23 20:55:41] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:41] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-23 20:55:41] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 20:55:41] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-23 20:55:41] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 641ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 642ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 646 ms. Remains : 20/20 places, 33/33 transitions.
[2024-05-23 20:55:41] [INFO ] Flatten gal took : 3 ms
[2024-05-23 20:55:41] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:41] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
[2024-05-23 20:55:41] [INFO ] Invariant cache hit.
[2024-05-23 20:55:41] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:41] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-23 20:55:41] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-23 20:55:41] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-23 20:55:41] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 629ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 630ms
Finished structural reductions in LTL mode , in 1 iterations and 630 ms. Remains : 20/20 places, 33/33 transitions.
[2024-05-23 20:55:42] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:42] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:42] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
[2024-05-23 20:55:42] [INFO ] Invariant cache hit.
[2024-05-23 20:55:42] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 20:55:42] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-23 20:55:42] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-23 20:55:42] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 656ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 656ms
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 20/20 places, 33/33 transitions.
[2024-05-23 20:55:43] [INFO ] Flatten gal took : 10 ms
[2024-05-23 20:55:43] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:43] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
[2024-05-23 20:55:43] [INFO ] Invariant cache hit.
[2024-05-23 20:55:43] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-23 20:55:43] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 20:55:43] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 20:55:43] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 646ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 646ms
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 20/20 places, 33/33 transitions.
[2024-05-23 20:55:43] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:43] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:43] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
[2024-05-23 20:55:43] [INFO ] Invariant cache hit.
[2024-05-23 20:55:43] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:43] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-23 20:55:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 20:55:43] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-23 20:55:43] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 627ms
Finished structural reductions in LTL mode , in 1 iterations and 628 ms. Remains : 20/20 places, 33/33 transitions.
[2024-05-23 20:55:44] [INFO ] Flatten gal took : 4 ms
[2024-05-23 20:55:44] [INFO ] Flatten gal took : 5 ms
[2024-05-23 20:55:44] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
[2024-05-23 20:55:44] [INFO ] Invariant cache hit.
[2024-05-23 20:55:44] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-23 20:55:44] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-23 20:55:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 4 ms to minimize.
[2024-05-23 20:55:44] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 570ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 570ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 572 ms. Remains : 20/20 places, 33/33 transitions.
[2024-05-23 20:55:44] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:44] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:44] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
[2024-05-23 20:55:44] [INFO ] Invariant cache hit.
[2024-05-23 20:55:44] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 20:55:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 20:55:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 20:55:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 640ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 640ms
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 20/20 places, 33/33 transitions.
[2024-05-23 20:55:45] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:55:45] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:45] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
[2024-05-23 20:55:45] [INFO ] Invariant cache hit.
[2024-05-23 20:55:45] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 20:55:45] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-23 20:55:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 20:55:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 684ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 684ms
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 20/20 places, 33/33 transitions.
[2024-05-23 20:55:46] [INFO ] Flatten gal took : 5 ms
[2024-05-23 20:55:46] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:46] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
[2024-05-23 20:55:46] [INFO ] Invariant cache hit.
[2024-05-23 20:55:46] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-23 20:55:46] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 20:55:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 20:55:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 20:55:46] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 648ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 648ms
Finished structural reductions in LTL mode , in 1 iterations and 649 ms. Remains : 20/20 places, 33/33 transitions.
[2024-05-23 20:55:46] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:46] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:46] [INFO ] Input system was already deterministic with 33 transitions.
[2024-05-23 20:55:46] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:46] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:55:47] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-23 20:55:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 33 transitions and 92 arcs took 4 ms.
Total runtime 9742 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running JoinFreeModules-PT-0004

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/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: 769
MODEL NAME: /home/mcc/execution/414/model
20 places, 33 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-0004-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0004-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0004-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0004-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0004-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0004-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0004-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0004-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0004-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0004-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716497748145

--------------------
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="JoinFreeModules-PT-0004"
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-0004, 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-171649610500010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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