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.r512-smll-171654407600404.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 ltsminxred
Input is Philosophers-COL-000050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407600404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 6.4K Apr 13 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 13 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 09:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 3.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K Apr 13 10:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 13 10:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 10:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 10:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 12K 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-COL-000050-LTLFireability-00
FORMULA_NAME Philosophers-COL-000050-LTLFireability-01
FORMULA_NAME Philosophers-COL-000050-LTLFireability-02
FORMULA_NAME Philosophers-COL-000050-LTLFireability-03
FORMULA_NAME Philosophers-COL-000050-LTLFireability-04
FORMULA_NAME Philosophers-COL-000050-LTLFireability-05
FORMULA_NAME Philosophers-COL-000050-LTLFireability-06
FORMULA_NAME Philosophers-COL-000050-LTLFireability-07
FORMULA_NAME Philosophers-COL-000050-LTLFireability-08
FORMULA_NAME Philosophers-COL-000050-LTLFireability-09
FORMULA_NAME Philosophers-COL-000050-LTLFireability-10
FORMULA_NAME Philosophers-COL-000050-LTLFireability-11
FORMULA_NAME Philosophers-COL-000050-LTLFireability-12
FORMULA_NAME Philosophers-COL-000050-LTLFireability-13
FORMULA_NAME Philosophers-COL-000050-LTLFireability-14
FORMULA_NAME Philosophers-COL-000050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717302115972

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 04:21:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 04:21:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 04:21:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-02 04:21:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-02 04:21:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1109 ms
[2024-06-02 04:21:59] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250 PT places and 250.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA Philosophers-COL-000050-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 04:21:59] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2024-06-02 04:21:59] [INFO ] Skeletonized 15 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000050-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000050-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 20132 steps (387 resets) in 175 ms. (114 steps per ms) remains 0/5 properties
[2024-06-02 04:22:00] [INFO ] Flatten gal took : 17 ms
[2024-06-02 04:22:00] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50) 50) 50)]] contains successor/predecessor on variables of sort Philo
[2024-06-02 04:22:00] [INFO ] Unfolded HLPN to a Petri net with 250 places and 250 transitions 800 arcs in 35 ms.
[2024-06-02 04:22:00] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000050-LTLFireability-07 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 10 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2024-06-02 04:22:00] [INFO ] Computed 100 invariants in 13 ms
[2024-06-02 04:22:00] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-06-02 04:22:00] [INFO ] Invariant cache hit.
[2024-06-02 04:22:00] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:22:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10918 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10523 ms.
Refiners :[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 21616ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21668ms
Finished structural reductions in LTL mode , in 1 iterations and 22335 ms. Remains : 250/250 places, 250/250 transitions.
Support contains 250 out of 250 places after structural reductions.
[2024-06-02 04:22:22] [INFO ] Flatten gal took : 104 ms
[2024-06-02 04:22:22] [INFO ] Flatten gal took : 100 ms
[2024-06-02 04:22:23] [INFO ] Input system was already deterministic with 250 transitions.
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 591 steps (0 resets) in 63 ms. (9 steps per ms) remains 0/8 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 20 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:22:23] [INFO ] Invariant cache hit.
[2024-06-02 04:22:23] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-02 04:22:23] [INFO ] Invariant cache hit.
[2024-06-02 04:22:24] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2024-06-02 04:22:24] [INFO ] Redundant transitions in 20 ms returned []
Running 150 sub problems to find dead transitions.
[2024-06-02 04:22:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 11038 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10264 ms.
Refiners :[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 21373ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21377ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21986 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-01
Product exploration explored 100000 steps with 663 reset in 1040 ms.
Product exploration explored 100000 steps with 677 reset in 785 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 115 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 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 355 steps (0 resets) in 9 ms. (35 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 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 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 23 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:22:48] [INFO ] Invariant cache hit.
[2024-06-02 04:22:48] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-06-02 04:22:48] [INFO ] Invariant cache hit.
[2024-06-02 04:22:49] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2024-06-02 04:22:49] [INFO ] Redundant transitions in 5 ms returned []
Running 150 sub problems to find dead transitions.
[2024-06-02 04:22:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10008 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7970 ms.
Refiners :[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 18035ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 18040ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18789 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 73 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)]
RANDOM walk for 323 steps (0 resets) in 8 ms. (35 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 148 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 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 675 reset in 682 ms.
Product exploration explored 100000 steps with 676 reset in 687 ms.
Support contains 100 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 35 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:23:09] [INFO ] Invariant cache hit.
[2024-06-02 04:23:09] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-02 04:23:09] [INFO ] Invariant cache hit.
[2024-06-02 04:23:09] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-06-02 04:23:09] [INFO ] Redundant transitions in 4 ms returned []
Running 150 sub problems to find dead transitions.
[2024-06-02 04:23:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10026 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9391 ms.
Refiners :[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 19450ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19454ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20015 ms. Remains : 250/250 places, 250/250 transitions.
Treatment of property Philosophers-COL-000050-LTLFireability-01 finished in 65745 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 7 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:23:29] [INFO ] Invariant cache hit.
[2024-06-02 04:23:29] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-02 04:23:29] [INFO ] Invariant cache hit.
[2024-06-02 04:23:29] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:23:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10913 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9180 ms.
Refiners :[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 20125ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 20127ms
Finished structural reductions in LTL mode , in 1 iterations and 20646 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 309 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-COL-000050-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-02 finished in 21006 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 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:23:50] [INFO ] Invariant cache hit.
[2024-06-02 04:23:50] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-02 04:23:50] [INFO ] Invariant cache hit.
[2024-06-02 04:23:50] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:23:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10753 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7977 ms.
Refiners :[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 18772ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 18781ms
Finished structural reductions in LTL mode , in 1 iterations and 19361 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 471 ms :[p2, false, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, (NOT p1), (AND (NOT p1) p2), false]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-03
Product exploration explored 100000 steps with 30263 reset in 2385 ms.
Product exploration explored 100000 steps with 30199 reset in 2397 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) p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 1666 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 266 ms :[p2, false, (AND (NOT p1) p2), p2, (NOT p1)]
RANDOM walk for 333 steps (0 resets) in 9 ms. (33 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 9 factoid took 1871 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 265 ms :[p2, false, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 256 ms :[p2, false, (AND (NOT p1) p2), p2, (NOT p1)]
[2024-06-02 04:24:19] [INFO ] Invariant cache hit.
[2024-06-02 04:24:20] [INFO ] [Real]Absence check using 100 positive place invariants in 91 ms returned sat
[2024-06-02 04:24:20] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2024-06-02 04:24:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 04:24:21] [INFO ] [Nat]Absence check using 100 positive place invariants in 90 ms returned sat
[2024-06-02 04:24:22] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2024-06-02 04:24:22] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 28 ms.
[2024-06-02 04:24:22] [INFO ] Added : 9 causal constraints over 2 iterations in 166 ms. Result :sat
Could not prove EG 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 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:24:22] [INFO ] Invariant cache hit.
[2024-06-02 04:24:22] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-02 04:24:22] [INFO ] Invariant cache hit.
[2024-06-02 04:24:23] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:24:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 11153 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9727 ms.
Refiners :[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 20948ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 20951ms
Finished structural reductions in LTL mode , in 1 iterations and 21551 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 p1) p2), (X (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 558 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 242 ms :[p2, false, (AND (NOT p1) p2), p2, (NOT p1)]
RANDOM walk for 540 steps (0 resets) in 15 ms. (33 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 2 factoid took 665 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 272 ms :[p2, false, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[p2, false, (AND (NOT p1) p2), p2, (NOT p1)]
[2024-06-02 04:24:46] [INFO ] Invariant cache hit.
[2024-06-02 04:24:46] [INFO ] [Real]Absence check using 100 positive place invariants in 90 ms returned sat
[2024-06-02 04:24:47] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2024-06-02 04:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 04:24:48] [INFO ] [Nat]Absence check using 100 positive place invariants in 88 ms returned sat
[2024-06-02 04:24:48] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2024-06-02 04:24:48] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 31 ms.
[2024-06-02 04:24:48] [INFO ] Added : 9 causal constraints over 2 iterations in 145 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 255 ms :[p2, false, (AND (NOT p1) p2), p2, (NOT p1)]
Product exploration explored 100000 steps with 25289 reset in 1987 ms.
Product exploration explored 100000 steps with 25358 reset in 1710 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 235 ms :[p2, false, (AND (NOT p1) p2), 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 17 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:24:53] [INFO ] Redundant transitions in 3 ms returned []
Running 150 sub problems to find dead transitions.
[2024-06-02 04:24:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10929 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10255 ms.
Refiners :[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 21224ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21258 ms. Remains : 250/250 places, 250/250 transitions.
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 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:25:14] [INFO ] Invariant cache hit.
[2024-06-02 04:25:14] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-02 04:25:14] [INFO ] Invariant cache hit.
[2024-06-02 04:25:15] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:25:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9365 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9965 ms.
Refiners :[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 19374ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19378ms
Finished structural reductions in LTL mode , in 1 iterations and 19970 ms. Remains : 250/250 places, 250/250 transitions.
Treatment of property Philosophers-COL-000050-LTLFireability-03 finished in 104280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U !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 18 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:25:34] [INFO ] Invariant cache hit.
[2024-06-02 04:25:34] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-02 04:25:34] [INFO ] Invariant cache hit.
[2024-06-02 04:25:35] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2024-06-02 04:25:35] [INFO ] Redundant transitions in 1 ms returned []
Running 150 sub problems to find dead transitions.
[2024-06-02 04:25:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9652 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9645 ms.
Refiners :[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 19341ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19345ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19972 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 108 ms :[p1, true, (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-04
Entered a terminal (fully accepting) state of product in 245 steps with 0 reset in 2 ms.
FORMULA Philosophers-COL-000050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-04 finished in 20111 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-06-02 04:25:54] [INFO ] Invariant cache hit.
[2024-06-02 04:25:54] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-02 04:25:54] [INFO ] Invariant cache hit.
[2024-06-02 04:25:55] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:25:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10980 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8829 ms.
Refiners :[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 19855ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19860ms
Finished structural reductions in LTL mode , in 1 iterations and 20429 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-06
Product exploration explored 100000 steps with 660 reset in 1215 ms.
Stack based approach found an accepted trace after 7526 steps with 52 reset with depth 143 and stack size 141 in 72 ms.
FORMULA Philosophers-COL-000050-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-06 finished in 21879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 100 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 6 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:26:16] [INFO ] Invariant cache hit.
[2024-06-02 04:26:16] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-02 04:26:16] [INFO ] Invariant cache hit.
[2024-06-02 04:26:17] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:26:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9501 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7276 ms.
Refiners :[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 16800ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 16803ms
Finished structural reductions in LTL mode , in 1 iterations and 17242 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 897 ms.
Product exploration explored 100000 steps with 50000 reset in 876 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000050-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000050-LTLFireability-09 finished in 19188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 100 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 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:26:35] [INFO ] Invariant cache hit.
[2024-06-02 04:26:35] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 04:26:35] [INFO ] Invariant cache hit.
[2024-06-02 04:26:36] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:26:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10941 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10186 ms.
Refiners :[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 21151ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21154ms
Finished structural reductions in LTL mode , in 1 iterations and 21529 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-10
Product exploration explored 100000 steps with 33008 reset in 1594 ms.
Stack based approach found an accepted trace after 7279 steps with 2392 reset with depth 4 and stack size 4 in 101 ms.
FORMULA Philosophers-COL-000050-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-10 finished in 23348 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((G(p0)&&(F(!p2)||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 6 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:26:59] [INFO ] Invariant cache hit.
[2024-06-02 04:26:59] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 04:26:59] [INFO ] Invariant cache hit.
[2024-06-02 04:26:59] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:26:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9674 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10498 ms.
Refiners :[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 20199ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 20201ms
Finished structural reductions in LTL mode , in 1 iterations and 20618 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) p2), true, (OR (NOT p0) (AND (NOT p1) p2))]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-12
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-12 finished in 20888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(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 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:27:20] [INFO ] Invariant cache hit.
[2024-06-02 04:27:20] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-02 04:27:20] [INFO ] Invariant cache hit.
[2024-06-02 04:27:20] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:27:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 11241 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9755 ms.
Refiners :[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 21038ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21042ms
Finished structural reductions in LTL mode , in 1 iterations and 21769 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), true, (AND p0 (NOT p2))]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-13 finished in 22110 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(G((!p0 U !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 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:27:42] [INFO ] Invariant cache hit.
[2024-06-02 04:27:42] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-02 04:27:42] [INFO ] Invariant cache hit.
[2024-06-02 04:27:42] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:27:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10962 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9738 ms.
Refiners :[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 20743ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 20747ms
Finished structural reductions in LTL mode , in 1 iterations and 21464 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 190 ms :[p1, p1, true, p1]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-14
Entered a terminal (fully accepting) state of product in 257 steps with 0 reset in 2 ms.
FORMULA Philosophers-COL-000050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-14 finished in 21696 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 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-06-02 04:28:03] [INFO ] Invariant cache hit.
[2024-06-02 04:28:04] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-02 04:28:04] [INFO ] Invariant cache hit.
[2024-06-02 04:28:04] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2024-06-02 04:28:04] [INFO ] Redundant transitions in 1 ms returned []
Running 150 sub problems to find dead transitions.
[2024-06-02 04:28:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9797 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9277 ms.
Refiners :[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 19111ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19592 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-15
Product exploration explored 100000 steps with 1906 reset in 1043 ms.
Product exploration explored 100000 steps with 1817 reset in 801 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 209 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 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 248 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 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2024-06-02 04:28:26] [INFO ] Invariant cache hit.
[2024-06-02 04:28:27] [INFO ] [Real]Absence check using 100 positive place invariants in 105 ms returned sat
[2024-06-02 04:28:28] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2024-06-02 04:28:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 04:28:29] [INFO ] [Nat]Absence check using 100 positive place invariants in 71 ms returned sat
[2024-06-02 04:28:30] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2024-06-02 04:28:30] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-02 04:28:30] [INFO ] Added : 6 causal constraints over 2 iterations in 122 ms. Result :sat
Could not prove EG (NOT p0)
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 13 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:28:30] [INFO ] Invariant cache hit.
[2024-06-02 04:28:30] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-02 04:28:30] [INFO ] Invariant cache hit.
[2024-06-02 04:28:30] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-06-02 04:28:30] [INFO ] Redundant transitions in 1 ms returned []
Running 150 sub problems to find dead transitions.
[2024-06-02 04:28:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10781 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9663 ms.
Refiners :[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 20486ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 20489ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21091 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 241 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 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 299 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
[2024-06-02 04:28:52] [INFO ] Invariant cache hit.
[2024-06-02 04:28:54] [INFO ] [Real]Absence check using 100 positive place invariants in 115 ms returned sat
[2024-06-02 04:28:55] [INFO ] [Real]Absence check using state equation in 930 ms returned sat
[2024-06-02 04:28:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 04:28:56] [INFO ] [Nat]Absence check using 100 positive place invariants in 94 ms returned sat
[2024-06-02 04:28:57] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-06-02 04:28:57] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 28 ms.
[2024-06-02 04:28:57] [INFO ] Added : 6 causal constraints over 2 iterations in 133 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1770 reset in 1129 ms.
Product exploration explored 100000 steps with 1893 reset in 806 ms.
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 7 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-06-02 04:28:59] [INFO ] Invariant cache hit.
[2024-06-02 04:28:59] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 04:28:59] [INFO ] Invariant cache hit.
[2024-06-02 04:28:59] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-06-02 04:28:59] [INFO ] Redundant transitions in 1 ms returned []
Running 150 sub problems to find dead transitions.
[2024-06-02 04:28:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9181 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10083 ms.
Refiners :[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 19301ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19303ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19731 ms. Remains : 250/250 places, 250/250 transitions.
Treatment of property Philosophers-COL-000050-LTLFireability-15 finished in 75240 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((G(F(!p0)) U (p1 U p0)))))'
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)))))'
Found a Lengthening insensitive property : Philosophers-COL-000050-LTLFireability-03
Stuttering acceptance computed with spot in 566 ms :[p2, false, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, (NOT p1), (AND (NOT p1) p2), false]
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions in LI_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-06-02 04:29:20] [INFO ] Invariant cache hit.
[2024-06-02 04:29:20] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-02 04:29:20] [INFO ] Invariant cache hit.
[2024-06-02 04:29:20] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-02 04:29:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 11096 ms.
Refiners :[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, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10748 ms.
Refiners :[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 21887ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21890ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 22495 ms. Remains : 250/250 places, 250/250 transitions.
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-03
Product exploration explored 100000 steps with 30187 reset in 2391 ms.
Stack based approach found an accepted trace after 51767 steps with 15714 reset with depth 5 and stack size 5 in 1632 ms.
Treatment of property Philosophers-COL-000050-LTLFireability-03 finished in 27307 ms.
FORMULA Philosophers-COL-000050-LTLFireability-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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)))'
[2024-06-02 04:29:46] [INFO ] Flatten gal took : 50 ms
[2024-06-02 04:29:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2024-06-02 04:29:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 250 transitions and 800 arcs took 11 ms.
Total runtime 468782 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Philosophers-COL-000050-LTLFireability-01
Could not compute solution for formula : Philosophers-COL-000050-LTLFireability-03
Could not compute solution for formula : Philosophers-COL-000050-LTLFireability-15

BK_STOP 1717305025901

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Philosophers-COL-000050-LTLFireability-01
ltl formula formula --ltl=/tmp/1695/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 250 places, 250 transitions and 800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1695/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1695/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1695/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1695/ltl_0_
ltl formula name Philosophers-COL-000050-LTLFireability-03
ltl formula formula --ltl=/tmp/1695/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 250 places, 250 transitions and 800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1695/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1695/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1695/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1695/ltl_1_
ltl formula name Philosophers-COL-000050-LTLFireability-15
ltl formula formula --ltl=/tmp/1695/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 250 places, 250 transitions and 800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1695/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1695/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1695/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1695/ltl_2_

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Philosophers-COL-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 r512-smll-171654407600404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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