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-171654407800508.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-000050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407800508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 60K Apr 13 10:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 389K Apr 13 10:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 13 09:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 229K Apr 13 09:53 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 31K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 13 10:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 291K Apr 13 10:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 102K Apr 13 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 720K Apr 13 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K 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 109K 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-000050-LTLFireability-00
FORMULA_NAME Philosophers-PT-000050-LTLFireability-01
FORMULA_NAME Philosophers-PT-000050-LTLFireability-02
FORMULA_NAME Philosophers-PT-000050-LTLFireability-03
FORMULA_NAME Philosophers-PT-000050-LTLFireability-04
FORMULA_NAME Philosophers-PT-000050-LTLFireability-05
FORMULA_NAME Philosophers-PT-000050-LTLFireability-06
FORMULA_NAME Philosophers-PT-000050-LTLFireability-07
FORMULA_NAME Philosophers-PT-000050-LTLFireability-08
FORMULA_NAME Philosophers-PT-000050-LTLFireability-09
FORMULA_NAME Philosophers-PT-000050-LTLFireability-10
FORMULA_NAME Philosophers-PT-000050-LTLFireability-11
FORMULA_NAME Philosophers-PT-000050-LTLFireability-12
FORMULA_NAME Philosophers-PT-000050-LTLFireability-13
FORMULA_NAME Philosophers-PT-000050-LTLFireability-14
FORMULA_NAME Philosophers-PT-000050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716914180832

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-000050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 16:36:22] [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 16:36:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:36:23] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-05-28 16:36:23] [INFO ] Transformed 250 places.
[2024-05-28 16:36:23] [INFO ] Transformed 250 transitions.
[2024-05-28 16:36:23] [INFO ] Found NUPN structural information;
[2024-05-28 16:36:23] [INFO ] Parsed PT model containing 250 places and 250 transitions and 800 arcs in 333 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-000050-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 250 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 64 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2024-05-28 16:36:23] [INFO ] Computed 100 invariants in 15 ms
[2024-05-28 16:36:24] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-28 16:36:24] [INFO ] Invariant cache hit.
[2024-05-28 16:36:24] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-28 16:36:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10650 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8403 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 19186ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19210ms
Finished structural reductions in LTL mode , in 1 iterations and 20110 ms. Remains : 250/250 places, 250/250 transitions.
Support contains 250 out of 250 places after structural reductions.
[2024-05-28 16:36:44] [INFO ] Flatten gal took : 77 ms
[2024-05-28 16:36:44] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:36:44] [INFO ] Input system was already deterministic with 250 transitions.
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 1046 steps (0 resets) in 179 ms. (5 steps per ms) remains 0/16 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' '!(F(G((G(F(!p0)) U (p1 U p0)))))'
Support contains 100 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 29 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-28 16:36:44] [INFO ] Invariant cache hit.
[2024-05-28 16:36:45] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-28 16:36:45] [INFO ] Invariant cache hit.
[2024-05-28 16:36:45] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2024-05-28 16:36:45] [INFO ] Redundant transitions in 12 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-28 16:36:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8285 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7485 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 15864ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 15867ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16633 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-01
Product exploration explored 100000 steps with 673 reset in 907 ms.
Product exploration explored 100000 steps with 691 reset in 732 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 : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 554 steps (0 resets) in 21 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 100 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 40 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-28 16:37:04] [INFO ] Invariant cache hit.
[2024-05-28 16:37:04] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-28 16:37:04] [INFO ] Invariant cache hit.
[2024-05-28 16:37:04] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-05-28 16:37:04] [INFO ] Redundant transitions in 6 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-28 16:37:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8647 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8630 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 17334ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 17339ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17948 ms. Remains : 250/250 places, 250/250 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 407 steps (0 resets) in 9 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 686 reset in 824 ms.
Product exploration explored 100000 steps with 685 reset in 869 ms.
Built C files in :
/tmp/ltsmin13286089523042335670
[2024-05-28 16:37:24] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2024-05-28 16:37:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:37:24] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2024-05-28 16:37:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:37:24] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2024-05-28 16:37:24] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:37:24] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13286089523042335670
Running compilation step : cd /tmp/ltsmin13286089523042335670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1456 ms.
Running link step : cd /tmp/ltsmin13286089523042335670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin13286089523042335670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6272798073895545788.hoa' '--buchi-type=spotba'
LTSmin run took 9638 ms.
FORMULA Philosophers-PT-000050-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-PT-000050-LTLFireability-01 finished in 50624 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((p0||G(p1)))&&G(p2))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-28 16:37:35] [INFO ] Invariant cache hit.
[2024-05-28 16:37:35] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-28 16:37:35] [INFO ] Invariant cache hit.
[2024-05-28 16:37:35] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-28 16:37:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10599 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7693 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 18329ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 18331ms
Finished structural reductions in LTL mode , in 1 iterations and 18901 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-02
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-02 finished in 19259 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' '!((p0 U G((F(p1) U X(p2)))))'
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-28 16:37:54] [INFO ] Invariant cache hit.
[2024-05-28 16:37:54] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-28 16:37:54] [INFO ] Invariant cache hit.
[2024-05-28 16:37:55] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-28 16:37:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7369 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7822 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 15223ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 15232ms
Finished structural reductions in LTL mode , in 1 iterations and 15750 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 472 ms :[(NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-03
Product exploration explored 100000 steps with 30353 reset in 2248 ms.
Product exploration explored 100000 steps with 30090 reset in 2306 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) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 1570 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
RANDOM walk for 479 steps (0 resets) in 13 ms. (34 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 9 factoid took 1534 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
[2024-05-28 16:38:19] [INFO ] Invariant cache hit.
[2024-05-28 16:38:20] [INFO ] [Real]Absence check using 100 positive place invariants in 185 ms returned sat
[2024-05-28 16:38:29] [INFO ] [Real]Absence check using state equation in 8803 ms returned sat
[2024-05-28 16:38:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:38:30] [INFO ] [Nat]Absence check using 100 positive place invariants in 72 ms returned sat
[2024-05-28 16:38:30] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2024-05-28 16:38:30] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-28 16:38:30] [INFO ] Added : 1 causal constraints over 1 iterations in 108 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 150 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-28 16:38:30] [INFO ] Invariant cache hit.
[2024-05-28 16:38:30] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-28 16:38:30] [INFO ] Invariant cache hit.
[2024-05-28 16:38:31] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-28 16:38:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8386 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7209 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 15640ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 15643ms
Finished structural reductions in LTL mode , in 1 iterations and 16198 ms. Remains : 250/250 places, 250/250 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 491 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
RANDOM walk for 613 steps (0 resets) in 14 ms. (40 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 806 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
[2024-05-28 16:38:49] [INFO ] Invariant cache hit.
[2024-05-28 16:38:49] [INFO ] [Real]Absence check using 100 positive place invariants in 186 ms returned sat
[2024-05-28 16:38:59] [INFO ] [Real]Absence check using state equation in 9306 ms returned sat
[2024-05-28 16:38:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:39:00] [INFO ] [Nat]Absence check using 100 positive place invariants in 61 ms returned sat
[2024-05-28 16:39:00] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2024-05-28 16:39:00] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-28 16:39:00] [INFO ] Added : 1 causal constraints over 1 iterations in 110 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 25288 reset in 1632 ms.
Product exploration explored 100000 steps with 25351 reset in 1693 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-28 16:39:05] [INFO ] Redundant transitions in 3 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-28 16:39:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8867 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8447 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 17342ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 17344ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17363 ms. Remains : 250/250 places, 250/250 transitions.
Built C files in :
/tmp/ltsmin8871225099838844114
[2024-05-28 16:39:22] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8871225099838844114
Running compilation step : cd /tmp/ltsmin8871225099838844114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1175 ms.
Running link step : cd /tmp/ltsmin8871225099838844114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8871225099838844114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1704474941114434558.hoa' '--buchi-type=spotba'
LTSmin run took 407 ms.
FORMULA Philosophers-PT-000050-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-PT-000050-LTLFireability-03 finished in 89431 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(p1)&&p0)) U p2))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 17 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-28 16:39:24] [INFO ] Invariant cache hit.
[2024-05-28 16:39:24] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-28 16:39:24] [INFO ] Invariant cache hit.
[2024-05-28 16:39:24] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2024-05-28 16:39:24] [INFO ] Redundant transitions in 3 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-28 16:39:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9191 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7299 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 16526ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 16530ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17146 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-04
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-04 finished in 17348 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(p0)&&G(p1))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-28 16:39:41] [INFO ] Invariant cache hit.
[2024-05-28 16:39:41] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-28 16:39:41] [INFO ] Invariant cache hit.
[2024-05-28 16:39:41] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-28 16:39:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7272 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8179 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 15486ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 15489ms
Finished structural reductions in LTL mode , in 1 iterations and 15937 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-06
Product exploration explored 100000 steps with 696 reset in 1314 ms.
Stack based approach found an accepted trace after 283 steps with 0 reset with depth 284 and stack size 284 in 5 ms.
FORMULA Philosophers-PT-000050-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-06 finished in 17439 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(p2)||p1))||p0)))'
Support contains 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-28 16:39:58] [INFO ] Invariant cache hit.
[2024-05-28 16:39:59] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-28 16:39:59] [INFO ] Invariant cache hit.
[2024-05-28 16:39:59] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-28 16:39:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9770 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9698 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 19505ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19508ms
Finished structural reductions in LTL mode , in 1 iterations and 20505 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-08
Entered a terminal (fully accepting) state of product in 387 steps with 129 reset in 4 ms.
FORMULA Philosophers-PT-000050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-08 finished in 20680 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(p0)&&X(p1)))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-28 16:40:19] [INFO ] Invariant cache hit.
[2024-05-28 16:40:19] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-28 16:40:19] [INFO ] Invariant cache hit.
[2024-05-28 16:40:20] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-28 16:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9429 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7439 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 16903ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 16906ms
Finished structural reductions in LTL mode , in 1 iterations and 17769 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-09
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 0 ms.
FORMULA Philosophers-PT-000050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-09 finished in 17941 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(p1)&&p0)))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 0 with 94 rules applied. Total rules applied 94 place count 203 transition count 203
Applied a total of 94 rules in 49 ms. Remains 203 /250 variables (removed 47) and now considering 203/250 (removed 47) transitions.
// Phase 1: matrix 203 rows 203 cols
[2024-05-28 16:40:37] [INFO ] Computed 100 invariants in 2 ms
[2024-05-28 16:40:37] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-28 16:40:37] [INFO ] Invariant cache hit.
[2024-05-28 16:40:38] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-05-28 16:40:38] [INFO ] Redundant transitions in 1 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-28 16:40:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 50/203 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 50/303 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 203/406 variables, 203/506 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/406 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 506 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4476 ms.
Refiners :[Domain max(s): 203/203 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 50/203 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 50/303 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 203/406 variables, 203/506 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 103/609 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 609 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4439 ms.
Refiners :[Domain max(s): 203/203 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 8938ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 8939ms
Starting structural reductions in SI_LTL mode, iteration 1 : 203/250 places, 203/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9837 ms. Remains : 203/250 places, 203/250 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-11
Stuttering criterion allowed to conclude after 7855 steps with 2 reset in 133 ms.
FORMULA Philosophers-PT-000050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-11 finished in 10068 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(F(p1))))))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2024-05-28 16:40:47] [INFO ] Computed 100 invariants in 3 ms
[2024-05-28 16:40:47] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-28 16:40:47] [INFO ] Invariant cache hit.
[2024-05-28 16:40:48] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-28 16:40:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9031 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 6758 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 15831ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 15834ms
Finished structural reductions in LTL mode , in 1 iterations and 16613 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-14
Stuttering criterion allowed to conclude after 2407 steps with 406 reset in 36 ms.
FORMULA Philosophers-PT-000050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-14 finished in 16820 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)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 202 transition count 202
Applied a total of 96 rules in 65 ms. Remains 202 /250 variables (removed 48) and now considering 202/250 (removed 48) transitions.
// Phase 1: matrix 202 rows 202 cols
[2024-05-28 16:41:04] [INFO ] Computed 100 invariants in 4 ms
[2024-05-28 16:41:04] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-28 16:41:04] [INFO ] Invariant cache hit.
[2024-05-28 16:41:05] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2024-05-28 16:41:05] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-28 16:41:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 50/202 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 50/202 variables, 50/252 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 50/302 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 202/404 variables, 202/504 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 504 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4832 ms.
Refiners :[Domain max(s): 202/202 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 50/202 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 50/202 variables, 50/252 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 50/302 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 202/404 variables, 202/504 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 102/606 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 606 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3556 ms.
Refiners :[Domain max(s): 202/202 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 8419ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 8421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 202/250 places, 202/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9356 ms. Remains : 202/250 places, 202/250 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-15
Stuttering criterion allowed to conclude after 6791 steps with 39 reset in 76 ms.
FORMULA Philosophers-PT-000050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-15 finished in 9547 ms.
All properties solved by simple procedures.
Total runtime 291048 ms.

BK_STOP 1716914474013

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-000050"
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-000050, 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-171654407800508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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