fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r267-smll-171654406300380
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Philosophers-COL-000005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
397.411 22902.00 45184.00 267.80 TFTFFFFFFFFFFFFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 7.7K Apr 13 08:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 08:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 13 08:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 13 08:44 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.8K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 13 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 08:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 08:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 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 9.7K 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-000005-LTLFireability-00
FORMULA_NAME Philosophers-COL-000005-LTLFireability-01
FORMULA_NAME Philosophers-COL-000005-LTLFireability-02
FORMULA_NAME Philosophers-COL-000005-LTLFireability-03
FORMULA_NAME Philosophers-COL-000005-LTLFireability-04
FORMULA_NAME Philosophers-COL-000005-LTLFireability-05
FORMULA_NAME Philosophers-COL-000005-LTLFireability-06
FORMULA_NAME Philosophers-COL-000005-LTLFireability-07
FORMULA_NAME Philosophers-COL-000005-LTLFireability-08
FORMULA_NAME Philosophers-COL-000005-LTLFireability-09
FORMULA_NAME Philosophers-COL-000005-LTLFireability-10
FORMULA_NAME Philosophers-COL-000005-LTLFireability-11
FORMULA_NAME Philosophers-COL-000005-LTLFireability-12
FORMULA_NAME Philosophers-COL-000005-LTLFireability-13
FORMULA_NAME Philosophers-COL-000005-LTLFireability-14
FORMULA_NAME Philosophers-COL-000005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716848980198

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-000005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:29:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 22:29:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:29:42] [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 22:29:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:29:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1168 ms
[2024-05-27 22:29:44] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25 PT places and 25.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 22:29:44] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2024-05-27 22:29:44] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-COL-000005-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 5482 steps (782 resets) in 128 ms. (42 steps per ms) remains 0/6 properties
[2024-05-27 22:29:44] [INFO ] Flatten gal took : 28 ms
[2024-05-27 22:29:44] [INFO ] Flatten gal took : 6 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 5) 5) 5)]] contains successor/predecessor on variables of sort Philo
[2024-05-27 22:29:44] [INFO ] Unfolded HLPN to a Petri net with 25 places and 25 transitions 80 arcs in 28 ms.
[2024-05-27 22:29:44] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 8 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-27 22:29:44] [INFO ] Computed 10 invariants in 7 ms
[2024-05-27 22:29:45] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-27 22:29:45] [INFO ] Invariant cache hit.
[2024-05-27 22:29:45] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-27 22:29:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 999ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1021ms
Finished structural reductions in LTL mode , in 1 iterations and 1366 ms. Remains : 25/25 places, 25/25 transitions.
Support contains 25 out of 25 places after structural reductions.
[2024-05-27 22:29:46] [INFO ] Flatten gal took : 13 ms
[2024-05-27 22:29:46] [INFO ] Flatten gal took : 17 ms
[2024-05-27 22:29:46] [INFO ] Input system was already deterministic with 25 transitions.
Reduction of identical properties reduced properties to check from 16 to 13
RANDOM walk for 72 steps (4 resets) in 12 ms. (5 steps per ms) remains 0/13 properties
FORMULA Philosophers-COL-000005-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Philosophers-COL-000005-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Philosophers-COL-000005-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-27 22:29:46] [INFO ] Invariant cache hit.
[2024-05-27 22:29:46] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-27 22:29:46] [INFO ] Invariant cache hit.
[2024-05-27 22:29:47] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-27 22:29:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 545ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 546ms
Finished structural reductions in LTL mode , in 1 iterations and 637 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 450 ms.
Product exploration explored 100000 steps with 50000 reset in 313 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 28 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000005-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000005-LTLFireability-00 finished in 1893 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 X(p0)))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-27 22:29:48] [INFO ] Invariant cache hit.
[2024-05-27 22:29:48] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-27 22:29:48] [INFO ] Invariant cache hit.
[2024-05-27 22:29:48] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-27 22:29:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 621ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 623ms
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-01 finished in 956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||G(p2)||p0)))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 6 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-27 22:29:49] [INFO ] Invariant cache hit.
[2024-05-27 22:29:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-27 22:29:49] [INFO ] Invariant cache hit.
[2024-05-27 22:29:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-27 22:29:49] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-27 22:29:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 671ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 796 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-02
Product exploration explored 100000 steps with 26006 reset in 1181 ms.
Product exploration explored 100000 steps with 25745 reset in 812 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 761 ms. Reduced automaton from 1 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (1046 resets) in 831 ms. (48 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (412 resets) in 602 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (269 resets) in 674 ms. (59 steps per ms) remains 2/2 properties
[2024-05-27 22:29:54] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Real declared 15/50 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (G (OR p0 (NOT p2) p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT p1)), (F p0), (F p2)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 24 ms. Reduced automaton from 1 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000005-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000005-LTLFireability-02 finished in 4359 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 (!p1&&G(p2)&&X(F(!p1)))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-27 22:29:54] [INFO ] Invariant cache hit.
[2024-05-27 22:29:54] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-27 22:29:54] [INFO ] Invariant cache hit.
[2024-05-27 22:29:54] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-27 22:29:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 634ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 635ms
Finished structural reductions in LTL mode , in 1 iterations and 745 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p2) p1), true, (NOT p2), p1, (NOT p2)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-03
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-03 finished in 1066 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 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-27 22:29:55] [INFO ] Invariant cache hit.
[2024-05-27 22:29:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-27 22:29:55] [INFO ] Invariant cache hit.
[2024-05-27 22:29:55] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-27 22:29:55] [INFO ] Redundant transitions in 1 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-27 22:29:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 706ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 707ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 841 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 111 ms :[p0, p0]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-05
Product exploration explored 100000 steps with 15627 reset in 293 ms.
Stack based approach found an accepted trace after 79 steps with 12 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-05 finished in 1274 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 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-27 22:29:56] [INFO ] Invariant cache hit.
[2024-05-27 22:29:56] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-27 22:29:56] [INFO ] Invariant cache hit.
[2024-05-27 22:29:56] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-27 22:29:56] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-27 22:29:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 662ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 662ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 785 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 169 ms :[p0, p0]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-08
Product exploration explored 100000 steps with 15660 reset in 258 ms.
Stack based approach found an accepted trace after 20 steps with 2 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-08 finished in 1229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-27 22:29:57] [INFO ] Invariant cache hit.
[2024-05-27 22:29:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 22:29:57] [INFO ] Invariant cache hit.
[2024-05-27 22:29:57] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-27 22:29:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 603ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 604ms
Finished structural reductions in LTL mode , in 1 iterations and 708 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-09
Stuttering criterion allowed to conclude after 27 steps with 5 reset in 1 ms.
FORMULA Philosophers-COL-000005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-09 finished in 897 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 U (p1||G(!p0))))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-27 22:29:58] [INFO ] Invariant cache hit.
[2024-05-27 22:29:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-27 22:29:58] [INFO ] Invariant cache hit.
[2024-05-27 22:29:58] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-27 22:29:58] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-27 22:29:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 675ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 792 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-10
Product exploration explored 100000 steps with 12665 reset in 347 ms.
Stack based approach found an accepted trace after 1729 steps with 217 reset with depth 5 and stack size 5 in 9 ms.
FORMULA Philosophers-COL-000005-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-10 finished in 1262 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(G(p1))||p0)))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-27 22:29:59] [INFO ] Invariant cache hit.
[2024-05-27 22:29:59] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-27 22:29:59] [INFO ] Invariant cache hit.
[2024-05-27 22:29:59] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-27 22:29:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 607ms
Finished structural reductions in LTL mode , in 1 iterations and 689 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-11
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000005-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-11 finished in 848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-27 22:30:00] [INFO ] Invariant cache hit.
[2024-05-27 22:30:00] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-27 22:30:00] [INFO ] Invariant cache hit.
[2024-05-27 22:30:00] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-27 22:30:00] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-27 22:30:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 590ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 591ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 696 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-13
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-13 finished in 762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(G(p0) U X(p1))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-27 22:30:01] [INFO ] Invariant cache hit.
[2024-05-27 22:30:01] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 22:30:01] [INFO ] Invariant cache hit.
[2024-05-27 22:30:01] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-27 22:30:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 611ms
Finished structural reductions in LTL mode , in 1 iterations and 723 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 345 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), true, p0, (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 23 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000005-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000005-LTLFireability-15 finished in 1595 ms.
All properties solved by simple procedures.
Total runtime 20399 ms.
ITS solved all properties within timeout

BK_STOP 1716849003100

--------------------
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-000005"
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-000005, 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-171654406300380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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