Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 21K Apr 13 09:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 13 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 09:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 184K Apr 13 09:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Apr 13 09:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 374K Apr 13 09:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 45K Apr 13 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 13 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 44K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716910228004

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 15:30:30] [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]
[2024-05-28 15:30:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:30:30] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-28 15:30:30] [INFO ] Transformed 100 places.
[2024-05-28 15:30:30] [INFO ] Transformed 100 transitions.
[2024-05-28 15:30:30] [INFO ] Found NUPN structural information;
[2024-05-28 15:30:30] [INFO ] Parsed PT model containing 100 places and 100 transitions and 320 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 130 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-PT-000020-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 34 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2024-05-28 15:30:31] [INFO ] Computed 40 invariants in 15 ms
[2024-05-28 15:30:31] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-28 15:30:31] [INFO ] Invariant cache hit.
[2024-05-28 15:30:31] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 15:30:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2443 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2626 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 5177ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 5200ms
Finished structural reductions in LTL mode , in 1 iterations and 5895 ms. Remains : 100/100 places, 100/100 transitions.
Support contains 100 out of 100 places after structural reductions.
[2024-05-28 15:30:37] [INFO ] Flatten gal took : 66 ms
[2024-05-28 15:30:37] [INFO ] Flatten gal took : 40 ms
[2024-05-28 15:30:37] [INFO ] Input system was already deterministic with 100 transitions.
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 1237 steps (0 resets) in 243 ms. (5 steps per ms) remains 0/17 properties
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 15:30:38] [INFO ] Invariant cache hit.
[2024-05-28 15:30:38] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 15:30:38] [INFO ] Invariant cache hit.
[2024-05-28 15:30:38] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 15:30:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2056 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2055 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 4139ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4141ms
Finished structural reductions in LTL mode , in 1 iterations and 4382 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 713 ms.
Product exploration explored 100000 steps with 50000 reset in 534 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 (Minato strategy)
Knowledge based reduction with 3 factoid took 34 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000020-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000020-LTLFireability-00 finished in 6063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((!p0||X(!p1)))||((!p0||X(!p1))&&F(G(!p1))))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 15:30:44] [INFO ] Invariant cache hit.
[2024-05-28 15:30:44] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 15:30:44] [INFO ] Invariant cache hit.
[2024-05-28 15:30:44] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 15:30:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1759 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1807 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3585ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3587ms
Finished structural reductions in LTL mode , in 1 iterations and 3859 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-01
Product exploration explored 100000 steps with 167 reset in 1134 ms.
Stack based approach found an accepted trace after 127 steps with 0 reset with depth 128 and stack size 125 in 2 ms.
FORMULA Philosophers-PT-000020-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-01 finished in 5136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(F(p1)) U G(p2))))'
Support contains 80 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 15:30:49] [INFO ] Invariant cache hit.
[2024-05-28 15:30:49] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-28 15:30:49] [INFO ] Invariant cache hit.
[2024-05-28 15:30:49] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-28 15:30:49] [INFO ] Redundant transitions in 3 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 15:30:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1627 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1486 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3156ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3158ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3325 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p2), (NOT p2), (AND (NOT p1) p2 (NOT p0))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-03
Product exploration explored 100000 steps with 4718 reset in 807 ms.
Stack based approach found an accepted trace after 2215 steps with 92 reset with depth 43 and stack size 40 in 17 ms.
FORMULA Philosophers-PT-000020-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-03 finished in 4444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (F(p0)&&((p2 U p3)||p1)))))'
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 15:30:53] [INFO ] Invariant cache hit.
[2024-05-28 15:30:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-28 15:30:53] [INFO ] Invariant cache hit.
[2024-05-28 15:30:53] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-28 15:30:53] [INFO ] Redundant transitions in 4 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 15:30:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1934 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1732 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3696ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3699ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3893 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-04
Product exploration explored 100000 steps with 10344 reset in 1288 ms.
Product exploration explored 100000 steps with 10258 reset in 959 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 (NOT p0) (NOT p1) p3 (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (OR p0 p1 p3 p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (OR p0 p1 p3 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))))]
Knowledge based reduction with 25 factoid took 823 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter insensitive) to 7 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (72 resets) in 1020 ms. (39 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40002 steps (18 resets) in 1028 ms. (38 steps per ms) remains 1/1 properties
[2024-05-28 15:31:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 40/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf11 is UNSAT
After SMT solving in domain Int declared 100/200 variables, and 140 constraints, problems are : Problem set: 1 solved, 0 unsolved in 84 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/100 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (OR p0 p1 p3 p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (OR p0 p1 p3 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (G (OR p0 (NOT p1) p2 p3))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2))))), (F (NOT (OR p2 p3))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F p1), (F (NOT (OR p0 p1 p2 p3))), (F p0), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2) (AND (NOT p0) p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p0 (NOT p2) p3)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2 p3)))
Knowledge based reduction with 26 factoid took 939 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000020-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000020-LTLFireability-04 finished in 9666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 15:31:03] [INFO ] Invariant cache hit.
[2024-05-28 15:31:03] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 15:31:03] [INFO ] Invariant cache hit.
[2024-05-28 15:31:03] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-28 15:31:03] [INFO ] Redundant transitions in 5 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 15:31:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1942 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2004 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3962ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3965ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4271 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-05
Product exploration explored 100000 steps with 166 reset in 763 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA Philosophers-PT-000020-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-05 finished in 5108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 15:31:08] [INFO ] Invariant cache hit.
[2024-05-28 15:31:08] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-28 15:31:08] [INFO ] Invariant cache hit.
[2024-05-28 15:31:08] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 15:31:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1601 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1731 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3348ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3350ms
Finished structural reductions in LTL mode , in 1 iterations and 3639 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-08
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-08 finished in 3786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(X(F(p1))))))))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 15:31:12] [INFO ] Invariant cache hit.
[2024-05-28 15:31:12] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-28 15:31:12] [INFO ] Invariant cache hit.
[2024-05-28 15:31:12] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 15:31:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1967 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2239 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 4226ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4227ms
Finished structural reductions in LTL mode , in 1 iterations and 4612 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-09
Product exploration explored 100000 steps with 17314 reset in 466 ms.
Stack based approach found an accepted trace after 4935 steps with 861 reset with depth 17 and stack size 17 in 26 ms.
FORMULA Philosophers-PT-000020-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-09 finished in 5374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 15:31:17] [INFO ] Invariant cache hit.
[2024-05-28 15:31:17] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 15:31:17] [INFO ] Invariant cache hit.
[2024-05-28 15:31:18] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 15:31:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1985 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1836 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3834ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3835ms
Finished structural reductions in LTL mode , in 1 iterations and 4222 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-10
Stuttering criterion allowed to conclude after 1404 steps with 69 reset in 8 ms.
FORMULA Philosophers-PT-000020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-10 finished in 4454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 15:31:22] [INFO ] Invariant cache hit.
[2024-05-28 15:31:22] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-28 15:31:22] [INFO ] Invariant cache hit.
[2024-05-28 15:31:22] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 15:31:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1589 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1651 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3259ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3260ms
Finished structural reductions in LTL mode , in 1 iterations and 3611 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 544 ms.
Product exploration explored 100000 steps with 50000 reset in 359 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 p0 p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000020-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000020-LTLFireability-11 finished in 4688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(!p1))))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 84 transition count 84
Applied a total of 32 rules in 32 ms. Remains 84 /100 variables (removed 16) and now considering 84/100 (removed 16) transitions.
// Phase 1: matrix 84 rows 84 cols
[2024-05-28 15:31:26] [INFO ] Computed 40 invariants in 2 ms
[2024-05-28 15:31:26] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 15:31:26] [INFO ] Invariant cache hit.
[2024-05-28 15:31:27] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-28 15:31:27] [INFO ] Redundant transitions in 2 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-28 15:31:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 20/84 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 84/168 variables, 84/208 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 208 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1338 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 20/84 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 84/168 variables, 84/208 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 44/252 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 252 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1240 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 2591ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2593ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/100 places, 84/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2932 ms. Remains : 84/100 places, 84/100 transitions.
Stuttering acceptance computed with spot in 148 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-12
Product exploration explored 100000 steps with 1089 reset in 401 ms.
Stack based approach found an accepted trace after 432 steps with 5 reset with depth 19 and stack size 18 in 1 ms.
FORMULA Philosophers-PT-000020-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-12 finished in 3500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2024-05-28 15:31:30] [INFO ] Computed 40 invariants in 7 ms
[2024-05-28 15:31:30] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-28 15:31:30] [INFO ] Invariant cache hit.
[2024-05-28 15:31:30] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 15:31:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1424 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2054 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3491ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3492ms
Finished structural reductions in LTL mode , in 1 iterations and 3810 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-14
Stuttering criterion allowed to conclude after 4770 steps with 896 reset in 16 ms.
FORMULA Philosophers-PT-000020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-14 finished in 3923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||(F(!p0)&&G(F(p1)))))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 83 transition count 83
Applied a total of 34 rules in 11 ms. Remains 83 /100 variables (removed 17) and now considering 83/100 (removed 17) transitions.
// Phase 1: matrix 83 rows 83 cols
[2024-05-28 15:31:34] [INFO ] Computed 40 invariants in 2 ms
[2024-05-28 15:31:34] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-28 15:31:34] [INFO ] Invariant cache hit.
[2024-05-28 15:31:34] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-28 15:31:34] [INFO ] Redundant transitions in 3 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-28 15:31:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 20/83 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 83/166 variables, 83/206 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 206 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1360 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 20/83 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 83/166 variables, 83/206 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 43/249 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/166 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 249 constraints, problems are : Problem set: 0 solved, 43 unsolved in 970 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 2343ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 2344ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/100 places, 83/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2689 ms. Remains : 83/100 places, 83/100 transitions.
Stuttering acceptance computed with spot in 256 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-15
Product exploration explored 100000 steps with 385 reset in 219 ms.
Stack based approach found an accepted trace after 30950 steps with 121 reset with depth 52 and stack size 51 in 77 ms.
FORMULA Philosophers-PT-000020-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-15 finished in 3266 ms.
All properties solved by simple procedures.
Total runtime 67186 ms.

BK_STOP 1716910297588

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Philosophers-PT-000020"
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-5568"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000020, 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 r268-smll-171654407800500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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