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.r267-smll-171654406300404.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 greatspnxred
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 r267-smll-171654406300404
=====================================================================

--------------------
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 1716850941275

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 23:02:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 23:02:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:02:24] [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-05-27 23:02:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 23:02:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1213 ms
[2024-05-27 23:02:25] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250 PT places and 250.0 transition bindings in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA Philosophers-COL-000050-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 23:02:25] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2024-05-27 23:02:25] [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 22570 steps (432 resets) in 341 ms. (65 steps per ms) remains 0/5 properties
[2024-05-27 23:02:26] [INFO ] Flatten gal took : 22 ms
[2024-05-27 23:02:26] [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-05-27 23:02:26] [INFO ] Unfolded HLPN to a Petri net with 250 places and 250 transitions 800 arcs in 39 ms.
[2024-05-27 23:02:26] [INFO ] Unfolded 12 HLPN properties in 1 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 13 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2024-05-27 23:02:26] [INFO ] Computed 100 invariants in 26 ms
[2024-05-27 23:02:26] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-27 23:02:26] [INFO ] Invariant cache hit.
[2024-05-27 23:02:27] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:02:27] [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 10554 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 10631 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 21342ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21374ms
Finished structural reductions in LTL mode , in 1 iterations and 22243 ms. Remains : 250/250 places, 250/250 transitions.
Support contains 250 out of 250 places after structural reductions.
[2024-05-27 23:02:48] [INFO ] Flatten gal took : 78 ms
[2024-05-27 23:02:48] [INFO ] Flatten gal took : 57 ms
[2024-05-27 23:02:49] [INFO ] Input system was already deterministic with 250 transitions.
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 711 steps (0 resets) in 103 ms. (6 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 19 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:02:49] [INFO ] Invariant cache hit.
[2024-05-27 23:02:49] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-27 23:02:49] [INFO ] Invariant cache hit.
[2024-05-27 23:02:49] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-27 23:02:49] [INFO ] Redundant transitions in 13 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-27 23:02: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 10565 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 9226 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 19846ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19852ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20307 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 409 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-01
Product exploration explored 100000 steps with 665 reset in 1214 ms.
Product exploration explored 100000 steps with 676 reset in 840 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 83 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 507 steps (0 resets) in 10 ms. (46 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 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 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 16 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:03:12] [INFO ] Invariant cache hit.
[2024-05-27 23:03:13] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-27 23:03:13] [INFO ] Invariant cache hit.
[2024-05-27 23:03:13] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-05-27 23:03:13] [INFO ] Redundant transitions in 3 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-27 23:03:13] [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 9605 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 8060 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 17700ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 17703ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18294 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 111 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)]
RANDOM walk for 619 steps (0 resets) in 17 ms. (34 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 136 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 667 reset in 1006 ms.
Product exploration explored 100000 steps with 676 reset in 671 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 22 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:03:33] [INFO ] Invariant cache hit.
[2024-05-27 23:03:33] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-27 23:03:33] [INFO ] Invariant cache hit.
[2024-05-27 23:03:33] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2024-05-27 23:03:33] [INFO ] Redundant transitions in 3 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-27 23:03:33] [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 10223 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 9528 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 19781ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19783ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20231 ms. Remains : 250/250 places, 250/250 transitions.
Treatment of property Philosophers-COL-000050-LTLFireability-01 finished in 64393 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 5 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:03:53] [INFO ] Invariant cache hit.
[2024-05-27 23:03:54] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-27 23:03:54] [INFO ] Invariant cache hit.
[2024-05-27 23:03:54] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:03:54] [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 10703 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 10072 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 20813ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 20816ms
Finished structural reductions in LTL mode , in 1 iterations and 21214 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 349 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 1 ms.
FORMULA Philosophers-COL-000050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-02 finished in 21586 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 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:04:15] [INFO ] Invariant cache hit.
[2024-05-27 23:04:15] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-27 23:04:15] [INFO ] Invariant cache hit.
[2024-05-27 23:04:16] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:04:16] [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 10827 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 10445 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 21318ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21321ms
Finished structural reductions in LTL mode , in 1 iterations and 21919 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 458 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 30248 reset in 2646 ms.
Stack based approach found an accepted trace after 7243 steps with 2193 reset with depth 5 and stack size 5 in 177 ms.
FORMULA Philosophers-COL-000050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-03 finished in 25241 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 9 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:04:40] [INFO ] Invariant cache hit.
[2024-05-27 23:04:40] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-27 23:04:40] [INFO ] Invariant cache hit.
[2024-05-27 23:04:40] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-27 23:04:41] [INFO ] Redundant transitions in 1 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-27 23:04:41] [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 10587 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 9997 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 20614ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 20616ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20963 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 118 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 133 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-04 finished in 21101 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 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:05:01] [INFO ] Invariant cache hit.
[2024-05-27 23:05:01] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-27 23:05:01] [INFO ] Invariant cache hit.
[2024-05-27 23:05:02] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:05:02] [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 10732 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 10370 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 21134ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21138ms
Finished structural reductions in LTL mode , in 1 iterations and 21628 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 109 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 612 reset in 1070 ms.
Stack based approach found an accepted trace after 4090 steps with 35 reset with depth 136 and stack size 136 in 41 ms.
FORMULA Philosophers-COL-000050-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-06 finished in 22868 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 5 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:05:24] [INFO ] Invariant cache hit.
[2024-05-27 23:05:24] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-27 23:05:24] [INFO ] Invariant cache hit.
[2024-05-27 23:05:25] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:05:25] [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 10809 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 10012 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 20855ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 20857ms
Finished structural reductions in LTL mode , in 1 iterations and 21289 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 67 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 989 ms.
Product exploration explored 100000 steps with 50000 reset in 832 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 16 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 23236 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-05-27 23:05:47] [INFO ] Invariant cache hit.
[2024-05-27 23:05:48] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-27 23:05:48] [INFO ] Invariant cache hit.
[2024-05-27 23:05:48] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:05:48] [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 10973 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 10704 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 21715ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21718ms
Finished structural reductions in LTL mode , in 1 iterations and 22236 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-10
Product exploration explored 100000 steps with 32698 reset in 1629 ms.
Stack based approach found an accepted trace after 80166 steps with 26254 reset with depth 4 and stack size 4 in 1044 ms.
FORMULA Philosophers-COL-000050-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-10 finished in 25029 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 2 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:06:12] [INFO ] Invariant cache hit.
[2024-05-27 23:06:13] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-27 23:06:13] [INFO ] Invariant cache hit.
[2024-05-27 23:06:13] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:06:13] [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 10928 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 10529 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 21496ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21500ms
Finished structural reductions in LTL mode , in 1 iterations and 21923 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 212 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 4 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 22155 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-05-27 23:06:35] [INFO ] Invariant cache hit.
[2024-05-27 23:06:35] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-27 23:06:35] [INFO ] Invariant cache hit.
[2024-05-27 23:06:35] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:06: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 10825 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 10368 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 21229ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21231ms
Finished structural reductions in LTL mode , in 1 iterations and 21858 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 273 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 4 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-13 finished in 22160 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-05-27 23:06:57] [INFO ] Invariant cache hit.
[2024-05-27 23:06:57] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-27 23:06:57] [INFO ] Invariant cache hit.
[2024-05-27 23:06:57] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:06:57] [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 10967 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 10375 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 21383ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21386ms
Finished structural reductions in LTL mode , in 1 iterations and 21962 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 119 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 2903 steps with 22 reset in 23 ms.
FORMULA Philosophers-COL-000050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-14 finished in 22128 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 8 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:07:19] [INFO ] Invariant cache hit.
[2024-05-27 23:07:19] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-27 23:07:19] [INFO ] Invariant cache hit.
[2024-05-27 23:07:19] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-27 23:07:19] [INFO ] Redundant transitions in 1 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-27 23:07:19] [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 10964 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 10081 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 21085ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21089ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21460 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-15
Product exploration explored 100000 steps with 1806 reset in 1082 ms.
Stack based approach found an accepted trace after 70215 steps with 1279 reset with depth 259 and stack size 259 in 581 ms.
FORMULA Philosophers-COL-000050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-15 finished in 23226 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)))))'
[2024-05-27 23:07:42] [INFO ] Flatten gal took : 22 ms
[2024-05-27 23:07:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-05-27 23:07:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 250 transitions and 800 arcs took 7 ms.
Total runtime 319075 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Philosophers-COL-000050

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 250
TRANSITIONS: 250
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.003s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1106
MODEL NAME: /home/mcc/execution/415/model
250 places, 250 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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

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="greatspnxred"
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 greatspnxred"
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 r267-smll-171654406300404"
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 ;