Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945600564.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBLF-PT-S04J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945600564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 13K Feb 26 14:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 14:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 26 14:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 145K Feb 26 14:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Feb 26 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 26 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 77K Feb 26 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 371K Feb 26 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.6M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678898666674

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 16:44:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 16:44:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 16:44:28] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2023-03-15 16:44:28] [INFO ] Transformed 618 places.
[2023-03-15 16:44:28] [INFO ] Transformed 3190 transitions.
[2023-03-15 16:44:28] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 172 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1564
Applied a total of 4 rules in 78 ms. Remains 614 /618 variables (removed 4) and now considering 1564/1564 (removed 0) transitions.
[2023-03-15 16:44:28] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 614 cols
[2023-03-15 16:44:28] [INFO ] Computed 50 place invariants in 101 ms
[2023-03-15 16:44:30] [INFO ] Dead Transitions using invariants and state equation in 1680 ms found 324 transitions.
Found 324 dead transitions using SMT.
Drop transitions removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
[2023-03-15 16:44:30] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
// Phase 1: matrix 1216 rows 614 cols
[2023-03-15 16:44:30] [INFO ] Computed 50 place invariants in 47 ms
[2023-03-15 16:44:31] [INFO ] Implicit Places using invariants in 856 ms returned [135, 201, 330, 365, 487, 556]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 859 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 608/618 places, 1240/1564 transitions.
Applied a total of 0 rules in 18 ms. Remains 608 /608 variables (removed 0) and now considering 1240/1240 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2662 ms. Remains : 608/618 places, 1240/1564 transitions.
Support contains 172 out of 608 places after structural reductions.
[2023-03-15 16:44:31] [INFO ] Flatten gal took : 123 ms
[2023-03-15 16:44:31] [INFO ] Flatten gal took : 86 ms
[2023-03-15 16:44:31] [INFO ] Input system was already deterministic with 1240 transitions.
Support contains 171 out of 608 places (down from 172) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 30) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-15 16:44:32] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
// Phase 1: matrix 1216 rows 608 cols
[2023-03-15 16:44:32] [INFO ] Computed 44 place invariants in 37 ms
[2023-03-15 16:44:32] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-15 16:44:32] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 31 ms returned sat
[2023-03-15 16:44:36] [INFO ] After 3886ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-15 16:44:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-15 16:44:36] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 66 ms returned sat
[2023-03-15 16:44:41] [INFO ] After 4986ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-15 16:44:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:44:47] [INFO ] After 6073ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-15 16:44:48] [INFO ] Deduced a trap composed of 349 places in 299 ms of which 5 ms to minimize.
[2023-03-15 16:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 434 ms
[2023-03-15 16:44:50] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 0 ms to minimize.
[2023-03-15 16:44:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 806 ms
[2023-03-15 16:44:51] [INFO ] After 9379ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 2601 ms.
[2023-03-15 16:44:53] [INFO ] After 17175ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 608 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 608 transition count 1192
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 560 transition count 1192
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 96 place count 560 transition count 1120
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 240 place count 488 transition count 1120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 243 place count 485 transition count 1117
Iterating global reduction 2 with 3 rules applied. Total rules applied 246 place count 485 transition count 1117
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 362 place count 427 transition count 1059
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 379 place count 427 transition count 1042
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 396 place count 410 transition count 1042
Applied a total of 396 rules in 165 ms. Remains 410 /608 variables (removed 198) and now considering 1042/1240 (removed 198) transitions.
[2023-03-15 16:44:54] [INFO ] Flow matrix only has 1018 transitions (discarded 24 similar events)
// Phase 1: matrix 1018 rows 410 cols
[2023-03-15 16:44:54] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-15 16:44:54] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 992 ms. Remains : 410/608 places, 1042/1240 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 198720 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{1=1}
Probabilistic random walk after 198720 steps, saw 140094 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-15 16:44:58] [INFO ] Flow matrix only has 1018 transitions (discarded 24 similar events)
[2023-03-15 16:44:58] [INFO ] Invariant cache hit.
[2023-03-15 16:44:58] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-15 16:44:58] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 19 ms returned sat
[2023-03-15 16:44:58] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 16:44:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-15 16:44:58] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 18 ms returned sat
[2023-03-15 16:45:00] [INFO ] After 2032ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 16:45:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:45:02] [INFO ] After 1949ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 16:45:02] [INFO ] Deduced a trap composed of 179 places in 200 ms of which 4 ms to minimize.
[2023-03-15 16:45:02] [INFO ] Deduced a trap composed of 182 places in 233 ms of which 1 ms to minimize.
[2023-03-15 16:45:03] [INFO ] Deduced a trap composed of 173 places in 245 ms of which 1 ms to minimize.
[2023-03-15 16:45:03] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 1 ms to minimize.
[2023-03-15 16:45:03] [INFO ] Deduced a trap composed of 176 places in 217 ms of which 1 ms to minimize.
[2023-03-15 16:45:03] [INFO ] Deduced a trap composed of 186 places in 201 ms of which 0 ms to minimize.
[2023-03-15 16:45:04] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 1 ms to minimize.
[2023-03-15 16:45:04] [INFO ] Deduced a trap composed of 185 places in 190 ms of which 1 ms to minimize.
[2023-03-15 16:45:05] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-15 16:45:05] [INFO ] Deduced a trap composed of 201 places in 184 ms of which 0 ms to minimize.
[2023-03-15 16:45:05] [INFO ] Deduced a trap composed of 204 places in 210 ms of which 0 ms to minimize.
[2023-03-15 16:45:06] [INFO ] Deduced a trap composed of 146 places in 194 ms of which 0 ms to minimize.
[2023-03-15 16:45:06] [INFO ] Deduced a trap composed of 173 places in 191 ms of which 1 ms to minimize.
[2023-03-15 16:45:06] [INFO ] Deduced a trap composed of 175 places in 198 ms of which 0 ms to minimize.
[2023-03-15 16:45:06] [INFO ] Deduced a trap composed of 208 places in 202 ms of which 1 ms to minimize.
[2023-03-15 16:45:07] [INFO ] Deduced a trap composed of 216 places in 189 ms of which 0 ms to minimize.
[2023-03-15 16:45:07] [INFO ] Deduced a trap composed of 209 places in 198 ms of which 1 ms to minimize.
[2023-03-15 16:45:08] [INFO ] Deduced a trap composed of 208 places in 204 ms of which 1 ms to minimize.
[2023-03-15 16:45:08] [INFO ] Deduced a trap composed of 198 places in 198 ms of which 0 ms to minimize.
[2023-03-15 16:45:08] [INFO ] Deduced a trap composed of 252 places in 190 ms of which 1 ms to minimize.
[2023-03-15 16:45:09] [INFO ] Deduced a trap composed of 218 places in 190 ms of which 1 ms to minimize.
[2023-03-15 16:45:09] [INFO ] Deduced a trap composed of 229 places in 200 ms of which 1 ms to minimize.
[2023-03-15 16:45:09] [INFO ] Deduced a trap composed of 166 places in 182 ms of which 0 ms to minimize.
[2023-03-15 16:45:10] [INFO ] Deduced a trap composed of 188 places in 198 ms of which 1 ms to minimize.
[2023-03-15 16:45:10] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7831 ms
[2023-03-15 16:45:10] [INFO ] After 9854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 403 ms.
[2023-03-15 16:45:10] [INFO ] After 12382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1042/1042 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 410 transition count 1041
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 409 transition count 1041
Applied a total of 2 rules in 62 ms. Remains 409 /410 variables (removed 1) and now considering 1041/1042 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 409/410 places, 1041/1042 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 229804 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229804 steps, saw 161338 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 16:45:13] [INFO ] Flow matrix only has 1017 transitions (discarded 24 similar events)
// Phase 1: matrix 1017 rows 409 cols
[2023-03-15 16:45:13] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-15 16:45:13] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 16:45:13] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-15 16:45:13] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 16:45:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-15 16:45:13] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-15 16:45:15] [INFO ] After 1258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 16:45:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:45:17] [INFO ] After 1800ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 16:45:17] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2023-03-15 16:45:17] [INFO ] Deduced a trap composed of 182 places in 187 ms of which 1 ms to minimize.
[2023-03-15 16:45:17] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 16:45:18] [INFO ] Deduced a trap composed of 172 places in 179 ms of which 1 ms to minimize.
[2023-03-15 16:45:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1029 ms
[2023-03-15 16:45:18] [INFO ] After 3134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 365 ms.
[2023-03-15 16:45:18] [INFO ] After 4861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 1041/1041 transitions.
Applied a total of 0 rules in 36 ms. Remains 409 /409 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 409/409 places, 1041/1041 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 1041/1041 transitions.
Applied a total of 0 rules in 22 ms. Remains 409 /409 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2023-03-15 16:45:18] [INFO ] Flow matrix only has 1017 transitions (discarded 24 similar events)
[2023-03-15 16:45:18] [INFO ] Invariant cache hit.
[2023-03-15 16:45:19] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-15 16:45:19] [INFO ] Flow matrix only has 1017 transitions (discarded 24 similar events)
[2023-03-15 16:45:19] [INFO ] Invariant cache hit.
[2023-03-15 16:45:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:45:24] [INFO ] Implicit Places using invariants and state equation in 5539 ms returned []
Implicit Place search using SMT with State Equation took 5995 ms to find 0 implicit places.
[2023-03-15 16:45:24] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-15 16:45:24] [INFO ] Flow matrix only has 1017 transitions (discarded 24 similar events)
[2023-03-15 16:45:24] [INFO ] Invariant cache hit.
[2023-03-15 16:45:25] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6794 ms. Remains : 409/409 places, 1041/1041 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 409 transition count 1017
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 404 transition count 1067
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 1 with 44 rules applied. Total rules applied 78 place count 404 transition count 1023
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 404 transition count 1017
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 398 transition count 1017
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 398 transition count 1006
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 112 place count 387 transition count 1006
Applied a total of 112 rules in 96 ms. Remains 387 /409 variables (removed 22) and now considering 1006/1041 (removed 35) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1006 rows 387 cols
[2023-03-15 16:45:25] [INFO ] Computed 44 place invariants in 21 ms
[2023-03-15 16:45:25] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-15 16:45:25] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-15 16:45:25] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 16:45:25] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2023-03-15 16:45:25] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-15 16:45:28] [INFO ] After 2969ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 16:45:28] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 5 ms to minimize.
[2023-03-15 16:45:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-15 16:45:29] [INFO ] After 3255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 335 ms.
[2023-03-15 16:45:29] [INFO ] After 3690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U p1))'
Support contains 18 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 608 transition count 1210
Reduce places removed 30 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 42 rules applied. Total rules applied 72 place count 578 transition count 1198
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 84 place count 566 transition count 1198
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 84 place count 566 transition count 1126
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 228 place count 494 transition count 1126
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 336 place count 440 transition count 1072
Applied a total of 336 rules in 69 ms. Remains 440 /608 variables (removed 168) and now considering 1072/1240 (removed 168) transitions.
[2023-03-15 16:45:29] [INFO ] Flow matrix only has 1048 transitions (discarded 24 similar events)
// Phase 1: matrix 1048 rows 440 cols
[2023-03-15 16:45:29] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-15 16:45:30] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
[2023-03-15 16:45:30] [INFO ] Flow matrix only has 1048 transitions (discarded 24 similar events)
[2023-03-15 16:45:30] [INFO ] Invariant cache hit.
[2023-03-15 16:45:31] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-15 16:45:31] [INFO ] Flow matrix only has 1048 transitions (discarded 24 similar events)
[2023-03-15 16:45:31] [INFO ] Invariant cache hit.
[2023-03-15 16:45:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:45:39] [INFO ] Implicit Places using invariants and state equation in 8097 ms returned []
Implicit Place search using SMT with State Equation took 8553 ms to find 0 implicit places.
[2023-03-15 16:45:39] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-15 16:45:39] [INFO ] Flow matrix only has 1048 transitions (discarded 24 similar events)
[2023-03-15 16:45:39] [INFO ] Invariant cache hit.
[2023-03-15 16:45:40] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 440/608 places, 1072/1240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10312 ms. Remains : 440/608 places, 1072/1240 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), p0]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s118 1) (GEQ s312 1) (GEQ s44 1) (GEQ s361 1) (GEQ s12 1) (GEQ s263 1)), p0:(OR (AND (GEQ s138 1) (GEQ s184 1)) (AND (GEQ s27 1) (GEQ s134 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13 reset in 522 ms.
Stack based approach found an accepted trace after 1529 steps with 0 reset with depth 1530 and stack size 1530 in 9 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-01 finished in 11101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 42 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 28 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-15 16:45:40] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2023-03-15 16:45:40] [INFO ] Computed 44 place invariants in 38 ms
[2023-03-15 16:45:42] [INFO ] Dead Transitions using invariants and state equation in 1356 ms found 0 transitions.
[2023-03-15 16:45:42] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:45:42] [INFO ] Invariant cache hit.
[2023-03-15 16:45:42] [INFO ] Implicit Places using invariants in 608 ms returned []
[2023-03-15 16:45:42] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:45:42] [INFO ] Invariant cache hit.
[2023-03-15 16:45:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:45:54] [INFO ] Implicit Places using invariants and state equation in 11932 ms returned []
Implicit Place search using SMT with State Equation took 12542 ms to find 0 implicit places.
[2023-03-15 16:45:54] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:45:54] [INFO ] Invariant cache hit.
[2023-03-15 16:45:56] [INFO ] Dead Transitions using invariants and state equation in 1285 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15223 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s253 1) (GEQ s564 1) (GEQ s65 1) (GEQ s126 1) (GEQ s192 1) (GEQ s249 1) (GEQ s197 1) (GEQ s555 1) (GEQ s76 1) (GEQ s13 1) (GEQ s16 1) (GEQ s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-02 finished in 15366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 13 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Applied a total of 0 rules in 7 ms. Remains 608 /608 variables (removed 0) and now considering 1240/1240 (removed 0) transitions.
[2023-03-15 16:45:56] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
// Phase 1: matrix 1216 rows 608 cols
[2023-03-15 16:45:56] [INFO ] Computed 44 place invariants in 31 ms
[2023-03-15 16:45:57] [INFO ] Dead Transitions using invariants and state equation in 1375 ms found 0 transitions.
[2023-03-15 16:45:57] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
[2023-03-15 16:45:57] [INFO ] Invariant cache hit.
[2023-03-15 16:45:58] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-15 16:45:58] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
[2023-03-15 16:45:58] [INFO ] Invariant cache hit.
[2023-03-15 16:45:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:46:12] [INFO ] Implicit Places using invariants and state equation in 14245 ms returned []
Implicit Place search using SMT with State Equation took 14807 ms to find 0 implicit places.
[2023-03-15 16:46:12] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
[2023-03-15 16:46:12] [INFO ] Invariant cache hit.
[2023-03-15 16:46:13] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17446 ms. Remains : 608/608 places, 1240/1240 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NOT (OR (GEQ s271 1) (GEQ s130 1) (GEQ s343 1) (GEQ s354 1) (GEQ s541 1) (GEQ s464 1))) (AND (GEQ s425 1) (GEQ s599 1)) (AND (GEQ s509 1) (GEQ s59...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 676 ms.
Product exploration explored 100000 steps with 50000 reset in 614 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 395 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-03 finished in 19247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 27 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 22 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-15 16:46:15] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2023-03-15 16:46:15] [INFO ] Computed 44 place invariants in 32 ms
[2023-03-15 16:46:16] [INFO ] Dead Transitions using invariants and state equation in 1373 ms found 0 transitions.
[2023-03-15 16:46:16] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:46:16] [INFO ] Invariant cache hit.
[2023-03-15 16:46:17] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-15 16:46:17] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:46:17] [INFO ] Invariant cache hit.
[2023-03-15 16:46:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:46:28] [INFO ] Implicit Places using invariants and state equation in 10783 ms returned []
Implicit Place search using SMT with State Equation took 11332 ms to find 0 implicit places.
[2023-03-15 16:46:28] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:46:28] [INFO ] Invariant cache hit.
[2023-03-15 16:46:29] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14057 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s214 9) (GEQ s307 1) (GEQ s379 1)) (AND (GEQ s9 1) (GEQ s214 9) (GEQ s355 1)) (AND (GEQ s214 9) (GEQ s241 1) (GEQ s379 1)) (AND (GEQ s179...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13067 steps with 4 reset in 76 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-04 finished in 14272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (p1&&(p2 U p3))))'
Support contains 62 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 24 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-15 16:46:30] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:46:30] [INFO ] Invariant cache hit.
[2023-03-15 16:46:32] [INFO ] Dead Transitions using invariants and state equation in 1353 ms found 0 transitions.
[2023-03-15 16:46:32] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:46:32] [INFO ] Invariant cache hit.
[2023-03-15 16:46:32] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-15 16:46:32] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:46:32] [INFO ] Invariant cache hit.
[2023-03-15 16:46:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:46:42] [INFO ] Implicit Places using invariants and state equation in 9671 ms returned []
Implicit Place search using SMT with State Equation took 10247 ms to find 0 implicit places.
[2023-03-15 16:46:42] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:46:42] [INFO ] Invariant cache hit.
[2023-03-15 16:46:43] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12970 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (NOT p3), (NOT p0), true, (AND (NOT p0) (NOT p3)), (NOT p3)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s454 1) (GEQ s579 1) (GEQ s295 1) (GEQ s191 1) (GEQ s400 1) (GEQ s574 1)), p3:(OR (AND (GEQ s40 1) (GEQ s498 1)) (AND (GEQ s40 1) (GEQ s95 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-05 finished in 14209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 608 transition count 1186
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 554 transition count 1186
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 554 transition count 1114
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 482 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 479 transition count 1111
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 479 transition count 1111
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 366 place count 425 transition count 1057
Applied a total of 366 rules in 65 ms. Remains 425 /608 variables (removed 183) and now considering 1057/1240 (removed 183) transitions.
[2023-03-15 16:46:44] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
// Phase 1: matrix 1033 rows 425 cols
[2023-03-15 16:46:44] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-15 16:46:44] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
[2023-03-15 16:46:44] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:46:44] [INFO ] Invariant cache hit.
[2023-03-15 16:46:45] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-15 16:46:45] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:46:45] [INFO ] Invariant cache hit.
[2023-03-15 16:46:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:46:56] [INFO ] Implicit Places using invariants and state equation in 11052 ms returned []
Implicit Place search using SMT with State Equation took 11511 ms to find 0 implicit places.
[2023-03-15 16:46:56] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-15 16:46:56] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:46:56] [INFO ] Invariant cache hit.
[2023-03-15 16:46:57] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/608 places, 1057/1240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13087 ms. Remains : 425/608 places, 1057/1240 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s32 1) (GEQ s73 1) (GEQ s367 1)) (AND (GEQ s32 1) (GEQ s73 1) (GEQ s229 1)) (AND (GEQ s32 1) (GEQ s73 1) (GEQ s75 1)) (AND (GEQ s32 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4300 reset in 418 ms.
Product exploration explored 100000 steps with 4291 reset in 449 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2023-03-15 16:46:58] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:46:58] [INFO ] Invariant cache hit.
[2023-03-15 16:46:58] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-15 16:46:59] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 60 ms returned sat
[2023-03-15 16:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 16:47:01] [INFO ] [Real]Absence check using state equation in 2896 ms returned sat
[2023-03-15 16:47:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 16:47:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-15 16:47:02] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 36 ms returned sat
[2023-03-15 16:47:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 16:47:04] [INFO ] [Nat]Absence check using state equation in 2211 ms returned sat
[2023-03-15 16:47:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:47:05] [INFO ] [Nat]Added 120 Read/Feed constraints in 1271 ms returned sat
[2023-03-15 16:47:06] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2023-03-15 16:47:06] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2023-03-15 16:47:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2023-03-15 16:47:06] [INFO ] Computed and/alt/rep : 711/4348/693 causal constraints (skipped 336 transitions) in 82 ms.
[2023-03-15 16:47:11] [INFO ] Added : 311 causal constraints over 63 iterations in 5436 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 1057/1057 transitions.
Applied a total of 0 rules in 23 ms. Remains 425 /425 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
[2023-03-15 16:47:11] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:47:11] [INFO ] Invariant cache hit.
[2023-03-15 16:47:12] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
[2023-03-15 16:47:12] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:47:12] [INFO ] Invariant cache hit.
[2023-03-15 16:47:12] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-15 16:47:12] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:47:12] [INFO ] Invariant cache hit.
[2023-03-15 16:47:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:47:28] [INFO ] Implicit Places using invariants and state equation in 15456 ms returned []
Implicit Place search using SMT with State Equation took 15889 ms to find 0 implicit places.
[2023-03-15 16:47:28] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 16:47:28] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:47:28] [INFO ] Invariant cache hit.
[2023-03-15 16:47:29] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17352 ms. Remains : 425/425 places, 1057/1057 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2023-03-15 16:47:29] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:47:29] [INFO ] Invariant cache hit.
[2023-03-15 16:47:30] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-15 16:47:30] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 59 ms returned sat
[2023-03-15 16:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 16:47:33] [INFO ] [Real]Absence check using state equation in 2938 ms returned sat
[2023-03-15 16:47:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 16:47:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-15 16:47:33] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-15 16:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 16:47:35] [INFO ] [Nat]Absence check using state equation in 2238 ms returned sat
[2023-03-15 16:47:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:47:37] [INFO ] [Nat]Added 120 Read/Feed constraints in 1327 ms returned sat
[2023-03-15 16:47:37] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 0 ms to minimize.
[2023-03-15 16:47:37] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2023-03-15 16:47:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2023-03-15 16:47:37] [INFO ] Computed and/alt/rep : 711/4348/693 causal constraints (skipped 336 transitions) in 75 ms.
[2023-03-15 16:47:43] [INFO ] Added : 311 causal constraints over 63 iterations in 5578 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4297 reset in 424 ms.
Product exploration explored 100000 steps with 4316 reset in 443 ms.
Built C files in :
/tmp/ltsmin18156614728565040178
[2023-03-15 16:47:44] [INFO ] Computing symmetric may disable matrix : 1057 transitions.
[2023-03-15 16:47:44] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 16:47:44] [INFO ] Computing symmetric may enable matrix : 1057 transitions.
[2023-03-15 16:47:44] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 16:47:44] [INFO ] Computing Do-Not-Accords matrix : 1057 transitions.
[2023-03-15 16:47:44] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 16:47:44] [INFO ] Built C files in 295ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18156614728565040178
Running compilation step : cd /tmp/ltsmin18156614728565040178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18156614728565040178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18156614728565040178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 1057/1057 transitions.
Applied a total of 0 rules in 17 ms. Remains 425 /425 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
[2023-03-15 16:47:47] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:47:47] [INFO ] Invariant cache hit.
[2023-03-15 16:47:48] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
[2023-03-15 16:47:48] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:47:48] [INFO ] Invariant cache hit.
[2023-03-15 16:47:48] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-15 16:47:48] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:47:48] [INFO ] Invariant cache hit.
[2023-03-15 16:47:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:48:04] [INFO ] Implicit Places using invariants and state equation in 15732 ms returned []
Implicit Place search using SMT with State Equation took 16202 ms to find 0 implicit places.
[2023-03-15 16:48:04] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-15 16:48:04] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-15 16:48:04] [INFO ] Invariant cache hit.
[2023-03-15 16:48:05] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17663 ms. Remains : 425/425 places, 1057/1057 transitions.
Built C files in :
/tmp/ltsmin554935422212939762
[2023-03-15 16:48:05] [INFO ] Computing symmetric may disable matrix : 1057 transitions.
[2023-03-15 16:48:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 16:48:05] [INFO ] Computing symmetric may enable matrix : 1057 transitions.
[2023-03-15 16:48:05] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 16:48:05] [INFO ] Computing Do-Not-Accords matrix : 1057 transitions.
[2023-03-15 16:48:05] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 16:48:05] [INFO ] Built C files in 249ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin554935422212939762
Running compilation step : cd /tmp/ltsmin554935422212939762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin554935422212939762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin554935422212939762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 16:48:08] [INFO ] Flatten gal took : 58 ms
[2023-03-15 16:48:08] [INFO ] Flatten gal took : 52 ms
[2023-03-15 16:48:08] [INFO ] Time to serialize gal into /tmp/LTL15888951643461653082.gal : 10 ms
[2023-03-15 16:48:08] [INFO ] Time to serialize properties into /tmp/LTL17148274401585412647.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15888951643461653082.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6928604176688891583.hoa' '-atoms' '/tmp/LTL17148274401585412647.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17148274401585412647.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6928604176688891583.hoa
Detected timeout of ITS tools.
[2023-03-15 16:48:23] [INFO ] Flatten gal took : 45 ms
[2023-03-15 16:48:24] [INFO ] Flatten gal took : 44 ms
[2023-03-15 16:48:24] [INFO ] Time to serialize gal into /tmp/LTL1861355073666784876.gal : 7 ms
[2023-03-15 16:48:24] [INFO ] Time to serialize properties into /tmp/LTL2473235718849859983.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1861355073666784876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2473235718849859983.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((IsMonitoring>=1)&&(BlockedTasks>=1))&&(NotifyEventEndOfCheckSourcesB_6>=1))||(((IsMonitoring>=1)&&(BlockedTasks>=1))&&(N...522
Formula 0 simplified : FG!"((((((IsMonitoring>=1)&&(BlockedTasks>=1))&&(NotifyEventEndOfCheckSourcesB_6>=1))||(((IsMonitoring>=1)&&(BlockedTasks>=1))&&(Not...516
Detected timeout of ITS tools.
[2023-03-15 16:48:39] [INFO ] Flatten gal took : 41 ms
[2023-03-15 16:48:39] [INFO ] Applying decomposition
[2023-03-15 16:48:39] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8041305400287607178.txt' '-o' '/tmp/graph8041305400287607178.bin' '-w' '/tmp/graph8041305400287607178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8041305400287607178.bin' '-l' '-1' '-v' '-w' '/tmp/graph8041305400287607178.weights' '-q' '0' '-e' '0.001'
[2023-03-15 16:48:39] [INFO ] Decomposing Gal with order
[2023-03-15 16:48:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 16:48:39] [INFO ] Removed a total of 891 redundant transitions.
[2023-03-15 16:48:39] [INFO ] Flatten gal took : 307 ms
[2023-03-15 16:48:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 30 ms.
[2023-03-15 16:48:39] [INFO ] Time to serialize gal into /tmp/LTL10198501555158524090.gal : 16 ms
[2023-03-15 16:48:39] [INFO ] Time to serialize properties into /tmp/LTL5560471198936777469.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10198501555158524090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5560471198936777469.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((i3.u3.IsMonitoring>=1)&&(i3.u15.BlockedTasks>=1))&&(i1.u10.NotifyEventEndOfCheckSourcesB_6>=1))||(((i3.u3.IsMonitoring>=...639
Formula 0 simplified : FG!"((((((i3.u3.IsMonitoring>=1)&&(i3.u15.BlockedTasks>=1))&&(i1.u10.NotifyEventEndOfCheckSourcesB_6>=1))||(((i3.u3.IsMonitoring>=1)...633
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15588431831753579428
[2023-03-15 16:48:54] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15588431831753579428
Running compilation step : cd /tmp/ltsmin15588431831753579428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2317 ms.
Running link step : cd /tmp/ltsmin15588431831753579428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15588431831753579428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-06 finished in 146080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 6 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 23 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-15 16:49:10] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2023-03-15 16:49:10] [INFO ] Computed 44 place invariants in 30 ms
[2023-03-15 16:49:11] [INFO ] Dead Transitions using invariants and state equation in 1305 ms found 0 transitions.
[2023-03-15 16:49:11] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:49:11] [INFO ] Invariant cache hit.
[2023-03-15 16:49:11] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-15 16:49:12] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:49:12] [INFO ] Invariant cache hit.
[2023-03-15 16:49:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:49:19] [INFO ] Implicit Places using invariants and state equation in 7988 ms returned []
Implicit Place search using SMT with State Equation took 8603 ms to find 0 implicit places.
[2023-03-15 16:49:19] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:49:19] [INFO ] Invariant cache hit.
[2023-03-15 16:49:21] [INFO ] Dead Transitions using invariants and state equation in 1337 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11272 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s142 1) (GEQ s34 1) (GEQ s519 1) (GEQ s129 1) (GEQ s415 1) (GEQ s378 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-07 finished in 11469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((G(p2)&&p1)))))'
Support contains 11 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 608 transition count 1202
Reduce places removed 38 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 45 rules applied. Total rules applied 83 place count 570 transition count 1195
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 90 place count 563 transition count 1195
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 90 place count 563 transition count 1116
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 248 place count 484 transition count 1116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 252 place count 480 transition count 1112
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 480 transition count 1112
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 326 place count 445 transition count 1077
Applied a total of 326 rules in 59 ms. Remains 445 /608 variables (removed 163) and now considering 1077/1240 (removed 163) transitions.
[2023-03-15 16:49:21] [INFO ] Flow matrix only has 1053 transitions (discarded 24 similar events)
// Phase 1: matrix 1053 rows 445 cols
[2023-03-15 16:49:21] [INFO ] Computed 44 place invariants in 21 ms
[2023-03-15 16:49:22] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
[2023-03-15 16:49:22] [INFO ] Flow matrix only has 1053 transitions (discarded 24 similar events)
[2023-03-15 16:49:22] [INFO ] Invariant cache hit.
[2023-03-15 16:49:22] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-15 16:49:22] [INFO ] Flow matrix only has 1053 transitions (discarded 24 similar events)
[2023-03-15 16:49:22] [INFO ] Invariant cache hit.
[2023-03-15 16:49:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:49:35] [INFO ] Implicit Places using invariants and state equation in 13086 ms returned []
Implicit Place search using SMT with State Equation took 13537 ms to find 0 implicit places.
[2023-03-15 16:49:35] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 16:49:35] [INFO ] Flow matrix only has 1053 transitions (discarded 24 similar events)
[2023-03-15 16:49:35] [INFO ] Invariant cache hit.
[2023-03-15 16:49:36] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 445/608 places, 1077/1240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15184 ms. Remains : 445/608 places, 1077/1240 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s62 1) (GEQ s275 1) (GEQ s305 1)), p1:(AND (GEQ s93 1) (GEQ s169 1)), p2:(AND (OR (LT s18 1) (LT s177 1) (LT s195 1)) (GEQ s81 1) (GEQ s230 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4006 steps with 0 reset in 15 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-08 finished in 15371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((((p0 U p1)&&X(!p0)) U X(p2))))))'
Support contains 6 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 25 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-15 16:49:36] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2023-03-15 16:49:36] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-15 16:49:38] [INFO ] Dead Transitions using invariants and state equation in 1373 ms found 0 transitions.
[2023-03-15 16:49:38] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:49:38] [INFO ] Invariant cache hit.
[2023-03-15 16:49:38] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-03-15 16:49:38] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:49:38] [INFO ] Invariant cache hit.
[2023-03-15 16:49:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:49:48] [INFO ] Implicit Places using invariants and state equation in 9268 ms returned []
Implicit Place search using SMT with State Equation took 9864 ms to find 0 implicit places.
[2023-03-15 16:49:48] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:49:48] [INFO ] Invariant cache hit.
[2023-03-15 16:49:49] [INFO ] Dead Transitions using invariants and state equation in 1303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12568 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 679 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(OR p1 p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s417 1) (GEQ s587 1)), p0:(AND (GEQ s141 1) (GEQ s372 1)), p2:(AND (GEQ s321 1) (GEQ s373 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-10 finished in 13282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 5 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 608 transition count 1186
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 554 transition count 1186
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 554 transition count 1114
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 482 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 479 transition count 1111
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 479 transition count 1111
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 376 place count 420 transition count 1052
Applied a total of 376 rules in 50 ms. Remains 420 /608 variables (removed 188) and now considering 1052/1240 (removed 188) transitions.
[2023-03-15 16:49:50] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
// Phase 1: matrix 1028 rows 420 cols
[2023-03-15 16:49:50] [INFO ] Computed 44 place invariants in 23 ms
[2023-03-15 16:49:50] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
[2023-03-15 16:49:50] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
[2023-03-15 16:49:50] [INFO ] Invariant cache hit.
[2023-03-15 16:49:51] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-15 16:49:51] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
[2023-03-15 16:49:51] [INFO ] Invariant cache hit.
[2023-03-15 16:49:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:49:59] [INFO ] Implicit Places using invariants and state equation in 7804 ms returned []
Implicit Place search using SMT with State Equation took 8296 ms to find 0 implicit places.
[2023-03-15 16:49:59] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-15 16:49:59] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
[2023-03-15 16:49:59] [INFO ] Invariant cache hit.
[2023-03-15 16:50:00] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/608 places, 1052/1240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9914 ms. Remains : 420/608 places, 1052/1240 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s111 1) (GEQ s387 2)), p1:(AND (GEQ s40 1) (GEQ s180 1) (GEQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14963 steps with 65 reset in 60 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-12 finished in 10067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((p1&&G(p2))))))'
Support contains 7 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 22 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-15 16:50:00] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2023-03-15 16:50:00] [INFO ] Computed 44 place invariants in 31 ms
[2023-03-15 16:50:01] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
[2023-03-15 16:50:01] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:01] [INFO ] Invariant cache hit.
[2023-03-15 16:50:02] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-15 16:50:02] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:02] [INFO ] Invariant cache hit.
[2023-03-15 16:50:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:50:11] [INFO ] Implicit Places using invariants and state equation in 8785 ms returned []
Implicit Place search using SMT with State Equation took 9344 ms to find 0 implicit places.
[2023-03-15 16:50:11] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:11] [INFO ] Invariant cache hit.
[2023-03-15 16:50:12] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12040 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s402 10) (LT s552 1) (LT s578 1)), p1:(GEQ s43 1), p2:(AND (GEQ s214 9) (GEQ s233 1) (GEQ s355 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17643 steps with 0 reset in 56 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-13 finished in 12345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 5 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 22 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-15 16:50:12] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:12] [INFO ] Invariant cache hit.
[2023-03-15 16:50:13] [INFO ] Dead Transitions using invariants and state equation in 1331 ms found 0 transitions.
[2023-03-15 16:50:13] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:13] [INFO ] Invariant cache hit.
[2023-03-15 16:50:14] [INFO ] Implicit Places using invariants in 551 ms returned []
[2023-03-15 16:50:14] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:14] [INFO ] Invariant cache hit.
[2023-03-15 16:50:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:50:22] [INFO ] Implicit Places using invariants and state equation in 8283 ms returned []
Implicit Place search using SMT with State Equation took 8836 ms to find 0 implicit places.
[2023-03-15 16:50:22] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:22] [INFO ] Invariant cache hit.
[2023-03-15 16:50:24] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11523 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s173 1) (LT s179 1) (LT s214 9)), p0:(AND (GEQ s7 1) (GEQ s448 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 28 reset in 421 ms.
Product exploration explored 100000 steps with 36 reset in 349 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Finished Best-First random walk after 5079 steps, including 1 resets, run visited all 2 properties in 24 ms. (steps per millisecond=211 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1228/1228 transitions.
Applied a total of 0 rules in 6 ms. Remains 596 /596 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2023-03-15 16:50:26] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:26] [INFO ] Invariant cache hit.
[2023-03-15 16:50:27] [INFO ] Dead Transitions using invariants and state equation in 1328 ms found 0 transitions.
[2023-03-15 16:50:27] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:27] [INFO ] Invariant cache hit.
[2023-03-15 16:50:28] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-15 16:50:28] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:28] [INFO ] Invariant cache hit.
[2023-03-15 16:50:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:50:40] [INFO ] Implicit Places using invariants and state equation in 12344 ms returned []
Implicit Place search using SMT with State Equation took 12871 ms to find 0 implicit places.
[2023-03-15 16:50:40] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:40] [INFO ] Invariant cache hit.
[2023-03-15 16:50:41] [INFO ] Dead Transitions using invariants and state equation in 1333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15541 ms. Remains : 596/596 places, 1228/1228 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 16:50:42] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-15 16:50:42] [INFO ] Invariant cache hit.
[2023-03-15 16:50:42] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-15 16:50:42] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 36 ms returned sat
[2023-03-15 16:50:43] [INFO ] After 1115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 16:50:43] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-15 16:50:43] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 33 ms returned sat
[2023-03-15 16:50:46] [INFO ] After 3383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 16:50:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:50:55] [INFO ] After 9091ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-15 16:50:55] [INFO ] After 12594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1228/1228 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 596 transition count 1192
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 560 transition count 1192
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 72 place count 560 transition count 1120
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 216 place count 488 transition count 1120
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 336 place count 428 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 339 place count 425 transition count 1057
Iterating global reduction 2 with 3 rules applied. Total rules applied 342 place count 425 transition count 1057
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 359 place count 425 transition count 1040
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 376 place count 408 transition count 1040
Applied a total of 376 rules in 72 ms. Remains 408 /596 variables (removed 188) and now considering 1040/1228 (removed 188) transitions.
[2023-03-15 16:50:55] [INFO ] Flow matrix only has 1016 transitions (discarded 24 similar events)
// Phase 1: matrix 1016 rows 408 cols
[2023-03-15 16:50:55] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-15 16:50:56] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 773 ms. Remains : 408/596 places, 1040/1228 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 89203 steps, run visited all 1 properties in 1111 ms. (steps per millisecond=80 )
Probabilistic random walk after 89203 steps, saw 63647 distinct states, run finished after 1111 ms. (steps per millisecond=80 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 44 reset in 320 ms.
Product exploration explored 100000 steps with 43 reset in 356 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1228/1228 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1228
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 30 place count 596 transition count 1276
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 66 place count 596 transition count 1276
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 584 transition count 1264
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 584 transition count 1264
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 192 place count 584 transition count 1264
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 213 place count 563 transition count 1243
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 234 place count 563 transition count 1243
Deduced a syphon composed of 138 places in 0 ms
Applied a total of 234 rules in 100 ms. Remains 563 /596 variables (removed 33) and now considering 1243/1228 (removed -15) transitions.
[2023-03-15 16:50:59] [INFO ] Flow matrix only has 1219 transitions (discarded 24 similar events)
// Phase 1: matrix 1219 rows 563 cols
[2023-03-15 16:50:59] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-15 16:51:00] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
[2023-03-15 16:51:00] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-15 16:51:00] [INFO ] Flow matrix only has 1219 transitions (discarded 24 similar events)
[2023-03-15 16:51:00] [INFO ] Invariant cache hit.
[2023-03-15 16:51:01] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 563/596 places, 1243/1228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2099 ms. Remains : 563/596 places, 1243/1228 transitions.
Built C files in :
/tmp/ltsmin7320835466390577692
[2023-03-15 16:51:01] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7320835466390577692
Running compilation step : cd /tmp/ltsmin7320835466390577692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2490 ms.
Running link step : cd /tmp/ltsmin7320835466390577692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7320835466390577692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15239866187231771006.hoa' '--buchi-type=spotba'
LTSmin run took 1905 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-14 finished in 53088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 608 transition count 1186
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 554 transition count 1186
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 554 transition count 1114
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 482 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 479 transition count 1111
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 479 transition count 1111
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 378 place count 419 transition count 1051
Applied a total of 378 rules in 57 ms. Remains 419 /608 variables (removed 189) and now considering 1051/1240 (removed 189) transitions.
[2023-03-15 16:51:05] [INFO ] Flow matrix only has 1027 transitions (discarded 24 similar events)
// Phase 1: matrix 1027 rows 419 cols
[2023-03-15 16:51:05] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-15 16:51:06] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
[2023-03-15 16:51:06] [INFO ] Flow matrix only has 1027 transitions (discarded 24 similar events)
[2023-03-15 16:51:06] [INFO ] Invariant cache hit.
[2023-03-15 16:51:06] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-15 16:51:06] [INFO ] Flow matrix only has 1027 transitions (discarded 24 similar events)
[2023-03-15 16:51:06] [INFO ] Invariant cache hit.
[2023-03-15 16:51:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 16:51:14] [INFO ] Implicit Places using invariants and state equation in 7140 ms returned []
Implicit Place search using SMT with State Equation took 7573 ms to find 0 implicit places.
[2023-03-15 16:51:14] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 16:51:14] [INFO ] Flow matrix only has 1027 transitions (discarded 24 similar events)
[2023-03-15 16:51:14] [INFO ] Invariant cache hit.
[2023-03-15 16:51:14] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/608 places, 1051/1240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9148 ms. Remains : 419/608 places, 1051/1240 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s66 1) (GEQ s341 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 749 steps with 1 reset in 8 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-15 finished in 9233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-15 16:51:15] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14226817365824887602
[2023-03-15 16:51:15] [INFO ] Computing symmetric may disable matrix : 1240 transitions.
[2023-03-15 16:51:15] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 16:51:15] [INFO ] Applying decomposition
[2023-03-15 16:51:15] [INFO ] Computing symmetric may enable matrix : 1240 transitions.
[2023-03-15 16:51:15] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 16:51:15] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5434366674674389601.txt' '-o' '/tmp/graph5434366674674389601.bin' '-w' '/tmp/graph5434366674674389601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5434366674674389601.bin' '-l' '-1' '-v' '-w' '/tmp/graph5434366674674389601.weights' '-q' '0' '-e' '0.001'
[2023-03-15 16:51:15] [INFO ] Decomposing Gal with order
[2023-03-15 16:51:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 16:51:15] [INFO ] Removed a total of 1202 redundant transitions.
[2023-03-15 16:51:15] [INFO ] Computing Do-Not-Accords matrix : 1240 transitions.
[2023-03-15 16:51:15] [INFO ] Flatten gal took : 89 ms
[2023-03-15 16:51:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 21 ms.
[2023-03-15 16:51:15] [INFO ] Time to serialize gal into /tmp/LTLFireability4384852250719670144.gal : 11 ms
[2023-03-15 16:51:15] [INFO ] Time to serialize properties into /tmp/LTLFireability13035362176349530267.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4384852250719670144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13035362176349530267.ltl' '-c' '-stutter-deadlock'
[2023-03-15 16:51:15] [INFO ] Computation of Completed DNA matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
[2023-03-15 16:51:15] [INFO ] Built C files in 385ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14226817365824887602
Running compilation step : cd /tmp/ltsmin14226817365824887602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((G(F("((((((i0.i1.u8.IsMonitoring>=1)&&(i0.i1.u26.BlockedTasks>=1))&&(u31.NotifyEventEndOfCheckSourcesB_6>=1))||(((i0.i1.u8.IsMonito...660
Formula 0 simplified : FG!"((((((i0.i1.u8.IsMonitoring>=1)&&(i0.i1.u26.BlockedTasks>=1))&&(u31.NotifyEventEndOfCheckSourcesB_6>=1))||(((i0.i1.u8.IsMonitori...654
Compilation finished in 4442 ms.
Running link step : cd /tmp/ltsmin14226817365824887602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin14226817365824887602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-15 17:13:31] [INFO ] Flatten gal took : 95 ms
[2023-03-15 17:13:31] [INFO ] Time to serialize gal into /tmp/LTLFireability8613216342905943463.gal : 20 ms
[2023-03-15 17:13:31] [INFO ] Time to serialize properties into /tmp/LTLFireability8471623899049020834.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8613216342905943463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8471623899049020834.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((IsMonitoring>=1)&&(BlockedTasks>=1))&&(NotifyEventEndOfCheckSourcesB_6>=1))||(((IsMonitoring>=1)&&(BlockedTasks>=1))&&(N...522
Formula 0 simplified : FG!"((((((IsMonitoring>=1)&&(BlockedTasks>=1))&&(NotifyEventEndOfCheckSourcesB_6>=1))||(((IsMonitoring>=1)&&(BlockedTasks>=1))&&(Not...516
Detected timeout of ITS tools.
[2023-03-15 17:35:47] [INFO ] Flatten gal took : 145 ms
[2023-03-15 17:35:47] [INFO ] Input system was already deterministic with 1240 transitions.
[2023-03-15 17:35:47] [INFO ] Transformed 608 places.
[2023-03-15 17:35:47] [INFO ] Transformed 1240 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 17:36:18] [INFO ] Time to serialize gal into /tmp/LTLFireability6255718273184845178.gal : 20 ms
[2023-03-15 17:36:18] [INFO ] Time to serialize properties into /tmp/LTLFireability5890187595265410201.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6255718273184845178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5890187595265410201.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((((((IsMonitoring>=1)&&(BlockedTasks>=1))&&(NotifyEventEndOfCheckSourcesB_6>=1))||(((IsMonitoring>=1)&&(BlockedTasks>=1))&&(N...522
Formula 0 simplified : FG!"((((((IsMonitoring>=1)&&(BlockedTasks>=1))&&(NotifyEventEndOfCheckSourcesB_6>=1))||(((IsMonitoring>=1)&&(BlockedTasks>=1))&&(Not...516
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8559636 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16169980 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J06T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBLF-PT-S04J06T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945600564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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