fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813694900602
Last Updated
May 14, 2023

About the Execution of LTSMin+red for BusinessProcesses-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16102.464 3600000.00 14282340.00 175.50 ???????TF???T?F? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694900602.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BusinessProcesses-PT-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900602
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 192K Mar 5 18:22 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 BusinessProcesses-PT-20-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678649615175

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:33:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 19:33:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:33:37] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-12 19:33:37] [INFO ] Transformed 782 places.
[2023-03-12 19:33:37] [INFO ] Transformed 697 transitions.
[2023-03-12 19:33:37] [INFO ] Found NUPN structural information;
[2023-03-12 19:33:37] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 63 places in 42 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 103 place count 616 transition count 549
Iterating global reduction 1 with 89 rules applied. Total rules applied 192 place count 616 transition count 549
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 230 place count 578 transition count 511
Iterating global reduction 1 with 38 rules applied. Total rules applied 268 place count 578 transition count 511
Applied a total of 268 rules in 161 ms. Remains 578 /719 variables (removed 141) and now considering 511/638 (removed 127) transitions.
// Phase 1: matrix 511 rows 578 cols
[2023-03-12 19:33:37] [INFO ] Computed 107 place invariants in 53 ms
[2023-03-12 19:33:38] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-12 19:33:38] [INFO ] Invariant cache hit.
[2023-03-12 19:33:38] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2023-03-12 19:33:38] [INFO ] Invariant cache hit.
[2023-03-12 19:33:39] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/719 places, 511/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1759 ms. Remains : 578/719 places, 511/638 transitions.
Support contains 99 out of 578 places after structural reductions.
[2023-03-12 19:33:39] [INFO ] Flatten gal took : 131 ms
[2023-03-12 19:33:39] [INFO ] Flatten gal took : 61 ms
[2023-03-12 19:33:39] [INFO ] Input system was already deterministic with 511 transitions.
Support contains 94 out of 578 places (down from 99) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 58) seen :31
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-12 19:33:40] [INFO ] Invariant cache hit.
[2023-03-12 19:33:41] [INFO ] [Real]Absence check using 65 positive place invariants in 27 ms returned sat
[2023-03-12 19:33:41] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 15 ms returned sat
[2023-03-12 19:33:41] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-12 19:33:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 24 ms returned sat
[2023-03-12 19:33:41] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 15 ms returned sat
[2023-03-12 19:33:43] [INFO ] After 969ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :25
[2023-03-12 19:33:43] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 6 ms to minimize.
[2023-03-12 19:33:43] [INFO ] Deduced a trap composed of 95 places in 260 ms of which 1 ms to minimize.
[2023-03-12 19:33:43] [INFO ] Deduced a trap composed of 94 places in 182 ms of which 1 ms to minimize.
[2023-03-12 19:33:44] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 2 ms to minimize.
[2023-03-12 19:33:44] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 1 ms to minimize.
[2023-03-12 19:33:44] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2023-03-12 19:33:44] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 2 ms to minimize.
[2023-03-12 19:33:44] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2023-03-12 19:33:44] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2023-03-12 19:33:45] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2023-03-12 19:33:45] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2023-03-12 19:33:45] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2023-03-12 19:33:45] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2023-03-12 19:33:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2380 ms
[2023-03-12 19:33:45] [INFO ] Deduced a trap composed of 116 places in 204 ms of which 0 ms to minimize.
[2023-03-12 19:33:45] [INFO ] Deduced a trap composed of 111 places in 206 ms of which 1 ms to minimize.
[2023-03-12 19:33:46] [INFO ] Deduced a trap composed of 109 places in 260 ms of which 0 ms to minimize.
[2023-03-12 19:33:46] [INFO ] Deduced a trap composed of 118 places in 156 ms of which 1 ms to minimize.
[2023-03-12 19:33:46] [INFO ] Deduced a trap composed of 122 places in 153 ms of which 1 ms to minimize.
[2023-03-12 19:33:46] [INFO ] Deduced a trap composed of 122 places in 193 ms of which 1 ms to minimize.
[2023-03-12 19:33:47] [INFO ] Deduced a trap composed of 112 places in 148 ms of which 1 ms to minimize.
[2023-03-12 19:33:47] [INFO ] Deduced a trap composed of 117 places in 186 ms of which 1 ms to minimize.
[2023-03-12 19:33:47] [INFO ] Deduced a trap composed of 115 places in 184 ms of which 2 ms to minimize.
[2023-03-12 19:33:47] [INFO ] Deduced a trap composed of 121 places in 274 ms of which 18 ms to minimize.
[2023-03-12 19:33:47] [INFO ] Deduced a trap composed of 120 places in 185 ms of which 1 ms to minimize.
[2023-03-12 19:33:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2486 ms
[2023-03-12 19:33:48] [INFO ] Deduced a trap composed of 125 places in 231 ms of which 1 ms to minimize.
[2023-03-12 19:33:48] [INFO ] Deduced a trap composed of 117 places in 254 ms of which 1 ms to minimize.
[2023-03-12 19:33:48] [INFO ] Deduced a trap composed of 126 places in 226 ms of which 1 ms to minimize.
[2023-03-12 19:33:49] [INFO ] Deduced a trap composed of 117 places in 225 ms of which 3 ms to minimize.
[2023-03-12 19:33:49] [INFO ] Deduced a trap composed of 127 places in 216 ms of which 1 ms to minimize.
[2023-03-12 19:33:49] [INFO ] Deduced a trap composed of 127 places in 224 ms of which 1 ms to minimize.
[2023-03-12 19:33:49] [INFO ] Deduced a trap composed of 112 places in 221 ms of which 1 ms to minimize.
[2023-03-12 19:33:50] [INFO ] Deduced a trap composed of 119 places in 219 ms of which 1 ms to minimize.
[2023-03-12 19:33:50] [INFO ] Deduced a trap composed of 121 places in 216 ms of which 1 ms to minimize.
[2023-03-12 19:33:50] [INFO ] Deduced a trap composed of 116 places in 159 ms of which 1 ms to minimize.
[2023-03-12 19:33:50] [INFO ] Deduced a trap composed of 117 places in 180 ms of which 4 ms to minimize.
[2023-03-12 19:33:50] [INFO ] Deduced a trap composed of 125 places in 170 ms of which 0 ms to minimize.
[2023-03-12 19:33:51] [INFO ] Deduced a trap composed of 113 places in 190 ms of which 0 ms to minimize.
[2023-03-12 19:33:51] [INFO ] Deduced a trap composed of 132 places in 188 ms of which 2 ms to minimize.
[2023-03-12 19:33:51] [INFO ] Deduced a trap composed of 123 places in 171 ms of which 0 ms to minimize.
[2023-03-12 19:33:51] [INFO ] Deduced a trap composed of 125 places in 145 ms of which 2 ms to minimize.
[2023-03-12 19:33:52] [INFO ] Deduced a trap composed of 111 places in 156 ms of which 0 ms to minimize.
[2023-03-12 19:33:52] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 1 ms to minimize.
[2023-03-12 19:33:52] [INFO ] Deduced a trap composed of 101 places in 191 ms of which 0 ms to minimize.
[2023-03-12 19:33:52] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 0 ms to minimize.
[2023-03-12 19:33:52] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 0 ms to minimize.
[2023-03-12 19:33:52] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4832 ms
[2023-03-12 19:33:53] [INFO ] Deduced a trap composed of 115 places in 200 ms of which 0 ms to minimize.
[2023-03-12 19:33:53] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 1 ms to minimize.
[2023-03-12 19:33:53] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 1 ms to minimize.
[2023-03-12 19:33:54] [INFO ] Deduced a trap composed of 113 places in 172 ms of which 0 ms to minimize.
[2023-03-12 19:33:54] [INFO ] Deduced a trap composed of 111 places in 180 ms of which 3 ms to minimize.
[2023-03-12 19:33:54] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 1 ms to minimize.
[2023-03-12 19:33:54] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 1 ms to minimize.
[2023-03-12 19:33:54] [INFO ] Deduced a trap composed of 135 places in 146 ms of which 1 ms to minimize.
[2023-03-12 19:33:54] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 0 ms to minimize.
[2023-03-12 19:33:55] [INFO ] Deduced a trap composed of 107 places in 236 ms of which 1 ms to minimize.
[2023-03-12 19:33:55] [INFO ] Deduced a trap composed of 106 places in 232 ms of which 1 ms to minimize.
[2023-03-12 19:33:55] [INFO ] Deduced a trap composed of 111 places in 215 ms of which 1 ms to minimize.
[2023-03-12 19:33:55] [INFO ] Deduced a trap composed of 112 places in 164 ms of which 1 ms to minimize.
[2023-03-12 19:33:56] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 0 ms to minimize.
[2023-03-12 19:33:56] [INFO ] Deduced a trap composed of 117 places in 160 ms of which 0 ms to minimize.
[2023-03-12 19:33:56] [INFO ] Deduced a trap composed of 109 places in 175 ms of which 0 ms to minimize.
[2023-03-12 19:33:56] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 0 ms to minimize.
[2023-03-12 19:33:57] [INFO ] Deduced a trap composed of 108 places in 207 ms of which 1 ms to minimize.
[2023-03-12 19:33:57] [INFO ] Deduced a trap composed of 123 places in 237 ms of which 4 ms to minimize.
[2023-03-12 19:33:57] [INFO ] Deduced a trap composed of 102 places in 220 ms of which 0 ms to minimize.
[2023-03-12 19:33:57] [INFO ] Deduced a trap composed of 128 places in 204 ms of which 3 ms to minimize.
[2023-03-12 19:33:58] [INFO ] Deduced a trap composed of 111 places in 200 ms of which 1 ms to minimize.
[2023-03-12 19:33:58] [INFO ] Deduced a trap composed of 114 places in 167 ms of which 3 ms to minimize.
[2023-03-12 19:33:58] [INFO ] Deduced a trap composed of 114 places in 231 ms of which 22 ms to minimize.
[2023-03-12 19:33:58] [INFO ] Deduced a trap composed of 117 places in 222 ms of which 1 ms to minimize.
[2023-03-12 19:33:59] [INFO ] Deduced a trap composed of 117 places in 200 ms of which 1 ms to minimize.
[2023-03-12 19:33:59] [INFO ] Deduced a trap composed of 113 places in 202 ms of which 1 ms to minimize.
[2023-03-12 19:33:59] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 0 ms to minimize.
[2023-03-12 19:33:59] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2023-03-12 19:33:59] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 0 ms to minimize.
[2023-03-12 19:33:59] [INFO ] Deduced a trap composed of 111 places in 150 ms of which 1 ms to minimize.
[2023-03-12 19:34:00] [INFO ] Deduced a trap composed of 106 places in 222 ms of which 0 ms to minimize.
[2023-03-12 19:34:00] [INFO ] Deduced a trap composed of 110 places in 172 ms of which 1 ms to minimize.
[2023-03-12 19:34:00] [INFO ] Deduced a trap composed of 119 places in 192 ms of which 1 ms to minimize.
[2023-03-12 19:34:00] [INFO ] Deduced a trap composed of 118 places in 163 ms of which 1 ms to minimize.
[2023-03-12 19:34:00] [INFO ] Deduced a trap composed of 126 places in 150 ms of which 1 ms to minimize.
[2023-03-12 19:34:01] [INFO ] Deduced a trap composed of 118 places in 139 ms of which 0 ms to minimize.
[2023-03-12 19:34:01] [INFO ] Deduced a trap composed of 126 places in 183 ms of which 0 ms to minimize.
[2023-03-12 19:34:01] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 0 ms to minimize.
[2023-03-12 19:34:01] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 1 ms to minimize.
[2023-03-12 19:34:01] [INFO ] Deduced a trap composed of 116 places in 168 ms of which 0 ms to minimize.
[2023-03-12 19:34:02] [INFO ] Deduced a trap composed of 119 places in 170 ms of which 1 ms to minimize.
[2023-03-12 19:34:02] [INFO ] Deduced a trap composed of 115 places in 131 ms of which 1 ms to minimize.
[2023-03-12 19:34:02] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 1 ms to minimize.
[2023-03-12 19:34:02] [INFO ] Deduced a trap composed of 118 places in 150 ms of which 1 ms to minimize.
[2023-03-12 19:34:02] [INFO ] Deduced a trap composed of 123 places in 155 ms of which 1 ms to minimize.
[2023-03-12 19:34:02] [INFO ] Deduced a trap composed of 117 places in 156 ms of which 0 ms to minimize.
[2023-03-12 19:34:03] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 1 ms to minimize.
[2023-03-12 19:34:03] [INFO ] Deduced a trap composed of 119 places in 281 ms of which 1 ms to minimize.
[2023-03-12 19:34:03] [INFO ] Deduced a trap composed of 132 places in 179 ms of which 0 ms to minimize.
[2023-03-12 19:34:03] [INFO ] Deduced a trap composed of 128 places in 249 ms of which 1 ms to minimize.
[2023-03-12 19:34:07] [INFO ] Deduced a trap composed of 116 places in 3321 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 19:34:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 19:34:07] [INFO ] After 26071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:27
Fused 27 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 561 ms.
Support contains 31 out of 578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 256 edges and 578 vertex of which 7 / 578 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1257 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 569 transition count 431
Reduce places removed 69 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 76 rules applied. Total rules applied 147 place count 500 transition count 424
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 154 place count 493 transition count 424
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 154 place count 493 transition count 325
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 370 place count 376 transition count 325
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 385 place count 361 transition count 310
Iterating global reduction 3 with 15 rules applied. Total rules applied 400 place count 361 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 400 place count 361 transition count 309
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 402 place count 360 transition count 309
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 676 place count 221 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 680 place count 219 transition count 181
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 682 place count 219 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 684 place count 217 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 685 place count 217 transition count 179
Applied a total of 685 rules in 192 ms. Remains 217 /578 variables (removed 361) and now considering 179/511 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 217/578 places, 179/511 transitions.
Incomplete random walk after 10000 steps, including 358 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 25) seen :21
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 19:34:08] [INFO ] Flow matrix only has 178 transitions (discarded 1 similar events)
// Phase 1: matrix 178 rows 217 cols
[2023-03-12 19:34:08] [INFO ] Computed 85 place invariants in 8 ms
[2023-03-12 19:34:08] [INFO ] [Real]Absence check using 64 positive place invariants in 15 ms returned sat
[2023-03-12 19:34:08] [INFO ] [Real]Absence check using 64 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-12 19:34:08] [INFO ] After 109ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 19:34:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 19:34:08] [INFO ] After 27ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 19:34:08] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 19:34:09] [INFO ] [Nat]Absence check using 64 positive place invariants in 11 ms returned sat
[2023-03-12 19:34:09] [INFO ] [Nat]Absence check using 64 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-12 19:34:09] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 19:34:09] [INFO ] After 47ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 19:34:09] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 23 ms to minimize.
[2023-03-12 19:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-12 19:34:09] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-12 19:34:09] [INFO ] After 577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 3 ms.
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 179/179 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 217 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 215 transition count 177
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4 place count 215 transition count 165
Deduced a syphon composed of 12 places in 14 ms
Ensure Unique test removed 4 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 32 place count 199 transition count 165
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 39 place count 192 transition count 158
Iterating global reduction 2 with 7 rules applied. Total rules applied 46 place count 192 transition count 158
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 66 place count 182 transition count 148
Applied a total of 66 rules in 52 ms. Remains 182 /217 variables (removed 35) and now considering 148/179 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 182/217 places, 148/179 transitions.
Incomplete random walk after 10000 steps, including 488 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 780460 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :{}
Probabilistic random walk after 780460 steps, saw 252906 distinct states, run finished after 3018 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 19:34:12] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 182 cols
[2023-03-12 19:34:12] [INFO ] Computed 81 place invariants in 6 ms
[2023-03-12 19:34:12] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:34:12] [INFO ] [Nat]Absence check using 64 positive place invariants in 13 ms returned sat
[2023-03-12 19:34:12] [INFO ] [Nat]Absence check using 64 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-12 19:34:13] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:34:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 19:34:13] [INFO ] After 49ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:34:13] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 19:34:13] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 148/148 transitions.
Applied a total of 0 rules in 8 ms. Remains 182 /182 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 182/182 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 148/148 transitions.
Applied a total of 0 rules in 7 ms. Remains 182 /182 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2023-03-12 19:34:13] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
[2023-03-12 19:34:13] [INFO ] Invariant cache hit.
[2023-03-12 19:34:13] [INFO ] Implicit Places using invariants in 175 ms returned [27, 28, 29, 30, 31, 36, 37, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 178 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 156/182 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 191 ms. Remains : 156/182 places, 148/148 transitions.
Incomplete random walk after 10000 steps, including 491 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1062285 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :{}
Probabilistic random walk after 1062285 steps, saw 346958 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 19:34:16] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 156 cols
[2023-03-12 19:34:16] [INFO ] Computed 55 place invariants in 4 ms
[2023-03-12 19:34:16] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:34:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 8 ms returned sat
[2023-03-12 19:34:16] [INFO ] [Nat]Absence check using 40 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-12 19:34:16] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:34:16] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 19:34:16] [INFO ] After 16ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:34:16] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2023-03-12 19:34:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-12 19:34:16] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 19:34:16] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2023-03-12 19:34:16] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
[2023-03-12 19:34:16] [INFO ] Invariant cache hit.
[2023-03-12 19:34:16] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-12 19:34:16] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
[2023-03-12 19:34:16] [INFO ] Invariant cache hit.
[2023-03-12 19:34:16] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 19:34:17] [INFO ] Implicit Places using invariants and state equation in 362 ms returned [5, 43, 44, 46, 54, 90, 92, 94, 96, 98, 100, 102]
Discarding 12 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 525 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 144/156 places, 144/148 transitions.
Graph (complete) has 488 edges and 144 vertex of which 135 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 135 transition count 140
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 131 transition count 140
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 20 place count 120 transition count 101
Iterating global reduction 2 with 11 rules applied. Total rules applied 31 place count 120 transition count 101
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 120 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 119 transition count 100
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 35 place count 117 transition count 98
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 117 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 39 place count 117 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 40 place count 116 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 44 place count 114 transition count 94
Applied a total of 44 rules in 13 ms. Remains 114 /144 variables (removed 30) and now considering 94/144 (removed 50) transitions.
[2023-03-12 19:34:17] [INFO ] Flow matrix only has 93 transitions (discarded 1 similar events)
// Phase 1: matrix 93 rows 114 cols
[2023-03-12 19:34:17] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-12 19:34:17] [INFO ] Implicit Places using invariants in 100 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 114 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 111/156 places, 94/148 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 108 transition count 91
Applied a total of 6 rules in 6 ms. Remains 108 /111 variables (removed 3) and now considering 91/94 (removed 3) transitions.
[2023-03-12 19:34:17] [INFO ] Flow matrix only has 90 transitions (discarded 1 similar events)
// Phase 1: matrix 90 rows 108 cols
[2023-03-12 19:34:17] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-12 19:34:17] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-12 19:34:17] [INFO ] Flow matrix only has 90 transitions (discarded 1 similar events)
[2023-03-12 19:34:17] [INFO ] Invariant cache hit.
[2023-03-12 19:34:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-12 19:34:17] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [23, 24, 26]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 262 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 105/156 places, 91/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 104 transition count 89
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 23 rules applied. Total rules applied 26 place count 90 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 87 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 87 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 87 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 86 transition count 75
Applied a total of 35 rules in 8 ms. Remains 86 /105 variables (removed 19) and now considering 75/91 (removed 16) transitions.
[2023-03-12 19:34:17] [INFO ] Flow matrix only has 74 transitions (discarded 1 similar events)
// Phase 1: matrix 74 rows 86 cols
[2023-03-12 19:34:17] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 19:34:17] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-12 19:34:17] [INFO ] Flow matrix only has 74 transitions (discarded 1 similar events)
[2023-03-12 19:34:17] [INFO ] Invariant cache hit.
[2023-03-12 19:34:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 19:34:17] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 86/156 places, 75/148 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1191 ms. Remains : 86/156 places, 75/148 transitions.
Incomplete random walk after 10000 steps, including 628 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1790859 steps, run timeout after 3001 ms. (steps per millisecond=596 ) properties seen :{}
Probabilistic random walk after 1790859 steps, saw 622078 distinct states, run finished after 3001 ms. (steps per millisecond=596 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 19:34:20] [INFO ] Flow matrix only has 74 transitions (discarded 1 similar events)
[2023-03-12 19:34:20] [INFO ] Invariant cache hit.
[2023-03-12 19:34:20] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:34:21] [INFO ] [Nat]Absence check using 24 positive place invariants in 5 ms returned sat
[2023-03-12 19:34:21] [INFO ] [Nat]Absence check using 24 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-12 19:34:21] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:34:21] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 19:34:21] [INFO ] After 11ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:34:21] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 19:34:21] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 86/86 places, 75/75 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-12 19:34:21] [INFO ] Flow matrix only has 74 transitions (discarded 1 similar events)
[2023-03-12 19:34:21] [INFO ] Invariant cache hit.
[2023-03-12 19:34:21] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-12 19:34:21] [INFO ] Flow matrix only has 74 transitions (discarded 1 similar events)
[2023-03-12 19:34:21] [INFO ] Invariant cache hit.
[2023-03-12 19:34:21] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 19:34:21] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-12 19:34:21] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 19:34:21] [INFO ] Flow matrix only has 74 transitions (discarded 1 similar events)
[2023-03-12 19:34:21] [INFO ] Invariant cache hit.
[2023-03-12 19:34:21] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 86/86 places, 75/75 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 86 transition count 67
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 81 transition count 67
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 81 transition count 64
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 78 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 77 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 76 transition count 74
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 31 place count 76 transition count 66
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 76 transition count 66
Applied a total of 34 rules in 11 ms. Remains 76 /86 variables (removed 10) and now considering 66/75 (removed 9) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 76 cols
[2023-03-12 19:34:21] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 19:34:21] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:34:21] [INFO ] [Nat]Absence check using 24 positive place invariants in 6 ms returned sat
[2023-03-12 19:34:21] [INFO ] [Nat]Absence check using 24 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-12 19:34:21] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:34:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:34:21] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:34:21] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 19:34:21] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-12 19:34:21] [INFO ] Flatten gal took : 31 ms
[2023-03-12 19:34:21] [INFO ] Flatten gal took : 42 ms
[2023-03-12 19:34:21] [INFO ] Input system was already deterministic with 511 transitions.
Support contains 84 out of 578 places (down from 85) after GAL structural reductions.
Computed a total of 505 stabilizing places and 448 stable transitions
Graph (complete) has 1265 edges and 578 vertex of which 575 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.39 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 286 edges and 578 vertex of which 7 / 578 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 568 transition count 422
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 490 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 489 transition count 421
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 160 place count 489 transition count 311
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 401 place count 358 transition count 311
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 428 place count 331 transition count 284
Iterating global reduction 3 with 27 rules applied. Total rules applied 455 place count 331 transition count 284
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 455 place count 331 transition count 282
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 459 place count 329 transition count 282
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 267 rules applied. Total rules applied 726 place count 194 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 728 place count 193 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 192 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 191 transition count 148
Applied a total of 730 rules in 102 ms. Remains 191 /578 variables (removed 387) and now considering 148/511 (removed 363) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 102 ms. Remains : 191/578 places, 148/511 transitions.
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 23 ms
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 9 ms
[2023-03-12 19:34:22] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 554 transition count 487
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 554 transition count 487
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 548 transition count 481
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 548 transition count 481
Applied a total of 60 rules in 45 ms. Remains 548 /578 variables (removed 30) and now considering 481/511 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 548/578 places, 481/511 transitions.
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 46 ms
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 22 ms
[2023-03-12 19:34:22] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 549 transition count 482
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 549 transition count 482
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 542 transition count 475
Applied a total of 72 rules in 56 ms. Remains 542 /578 variables (removed 36) and now considering 475/511 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 542/578 places, 475/511 transitions.
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 16 ms
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 16 ms
[2023-03-12 19:34:22] [INFO ] Input system was already deterministic with 475 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 549 transition count 482
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 549 transition count 482
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 541 transition count 474
Applied a total of 74 rules in 31 ms. Remains 541 /578 variables (removed 37) and now considering 474/511 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 541/578 places, 474/511 transitions.
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 15 ms
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 27 ms
[2023-03-12 19:34:22] [INFO ] Input system was already deterministic with 474 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 547 transition count 480
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 547 transition count 480
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 538 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 538 transition count 471
Applied a total of 80 rules in 54 ms. Remains 538 /578 variables (removed 40) and now considering 471/511 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 538/578 places, 471/511 transitions.
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 15 ms
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 14 ms
[2023-03-12 19:34:22] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 548 transition count 481
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 548 transition count 481
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 539 transition count 472
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 539 transition count 472
Applied a total of 78 rules in 44 ms. Remains 539 /578 variables (removed 39) and now considering 472/511 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 539/578 places, 472/511 transitions.
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 16 ms
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 13 ms
[2023-03-12 19:34:22] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 547 transition count 480
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 547 transition count 480
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 538 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 538 transition count 471
Applied a total of 80 rules in 43 ms. Remains 538 /578 variables (removed 40) and now considering 471/511 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 538/578 places, 471/511 transitions.
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 13 ms
[2023-03-12 19:34:22] [INFO ] Flatten gal took : 17 ms
[2023-03-12 19:34:22] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 289 edges and 578 vertex of which 7 / 578 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 568 transition count 419
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 487 transition count 419
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 164 place count 487 transition count 308
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 243 rules applied. Total rules applied 407 place count 355 transition count 308
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 436 place count 326 transition count 279
Iterating global reduction 2 with 29 rules applied. Total rules applied 465 place count 326 transition count 279
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 465 place count 326 transition count 277
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 469 place count 324 transition count 277
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 737 place count 188 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 739 place count 187 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 740 place count 186 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 741 place count 185 transition count 143
Applied a total of 741 rules in 59 ms. Remains 185 /578 variables (removed 393) and now considering 143/511 (removed 368) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 185/578 places, 143/511 transitions.
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 18 ms
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 6 ms
[2023-03-12 19:34:23] [INFO ] Input system was already deterministic with 143 transitions.
Finished random walk after 84 steps, including 6 resets, run visited all 1 properties in 4 ms. (steps per millisecond=21 )
FORMULA BusinessProcesses-PT-20-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 547 transition count 480
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 547 transition count 480
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 538 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 538 transition count 471
Applied a total of 80 rules in 55 ms. Remains 538 /578 variables (removed 40) and now considering 471/511 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 538/578 places, 471/511 transitions.
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 21 ms
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 12 ms
[2023-03-12 19:34:23] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 548 transition count 481
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 548 transition count 481
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 539 transition count 472
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 539 transition count 472
Applied a total of 78 rules in 75 ms. Remains 539 /578 variables (removed 39) and now considering 472/511 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 539/578 places, 472/511 transitions.
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 26 ms
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 13 ms
[2023-03-12 19:34:23] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 287 edges and 578 vertex of which 7 / 578 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 568 transition count 421
Reduce places removed 79 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 161 place count 489 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 488 transition count 420
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 162 place count 488 transition count 307
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 410 place count 353 transition count 307
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 437 place count 326 transition count 280
Iterating global reduction 3 with 27 rules applied. Total rules applied 464 place count 326 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 464 place count 326 transition count 279
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 466 place count 325 transition count 279
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 726 place count 193 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 728 place count 192 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 191 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 190 transition count 149
Applied a total of 730 rules in 65 ms. Remains 190 /578 variables (removed 388) and now considering 149/511 (removed 362) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 190/578 places, 149/511 transitions.
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 5 ms
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 5 ms
[2023-03-12 19:34:23] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 291 edges and 578 vertex of which 7 / 578 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 568 transition count 419
Reduce places removed 81 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 487 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 486 transition count 418
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 166 place count 486 transition count 305
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 414 place count 351 transition count 305
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 443 place count 322 transition count 276
Iterating global reduction 3 with 29 rules applied. Total rules applied 472 place count 322 transition count 276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 472 place count 322 transition count 274
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 476 place count 320 transition count 274
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 742 place count 185 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 744 place count 184 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 745 place count 183 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 746 place count 182 transition count 141
Applied a total of 746 rules in 57 ms. Remains 182 /578 variables (removed 396) and now considering 141/511 (removed 370) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 182/578 places, 141/511 transitions.
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 5 ms
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 20 ms
[2023-03-12 19:34:23] [INFO ] Input system was already deterministic with 141 transitions.
Incomplete random walk after 10000 steps, including 1291 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 296 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 867 steps, run visited all 1 properties in 7 ms. (steps per millisecond=123 )
Probabilistic random walk after 867 steps, saw 382 distinct states, run finished after 7 ms. (steps per millisecond=123 ) properties seen :1
FORMULA BusinessProcesses-PT-20-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 551 transition count 484
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 551 transition count 484
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 542 transition count 475
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 542 transition count 475
Applied a total of 72 rules in 51 ms. Remains 542 /578 variables (removed 36) and now considering 475/511 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 542/578 places, 475/511 transitions.
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 13 ms
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 12 ms
[2023-03-12 19:34:23] [INFO ] Input system was already deterministic with 475 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 549 transition count 482
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 549 transition count 482
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 540 transition count 473
Applied a total of 76 rules in 61 ms. Remains 540 /578 variables (removed 38) and now considering 473/511 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 540/578 places, 473/511 transitions.
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 24 ms
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 11 ms
[2023-03-12 19:34:23] [INFO ] Input system was already deterministic with 473 transitions.
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 12 ms
[2023-03-12 19:34:23] [INFO ] Flatten gal took : 13 ms
[2023-03-12 19:34:23] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-12 19:34:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 578 places, 511 transitions and 1591 arcs took 5 ms.
Total runtime 46749 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/870/ctl_0_ --ctl=/tmp/870/ctl_1_ --ctl=/tmp/870/ctl_2_ --ctl=/tmp/870/ctl_3_ --ctl=/tmp/870/ctl_4_ --ctl=/tmp/870/ctl_5_ --ctl=/tmp/870/ctl_6_ --ctl=/tmp/870/ctl_7_ --ctl=/tmp/870/ctl_8_ --ctl=/tmp/870/ctl_9_ --ctl=/tmp/870/ctl_10_ --ctl=/tmp/870/ctl_11_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 191356 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16224100 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="BusinessProcesses-PT-20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-20, 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 r041-tajo-167813694900602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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