About the Execution of 2023-gold for Philosophers-PT-000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 800.896 | 20432.00 | 42379.00 | 443.40 | FFTTFFFFFTFTFFFF | 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.r285-smll-171654422400308.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 gold2023
Input is Philosophers-PT-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422400308
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 17K Apr 13 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 13 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 09:24 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 7.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 13 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 13 09:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Apr 13 09:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 22K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-000010-LTLFireability-00
FORMULA_NAME Philosophers-PT-000010-LTLFireability-01
FORMULA_NAME Philosophers-PT-000010-LTLFireability-02
FORMULA_NAME Philosophers-PT-000010-LTLFireability-03
FORMULA_NAME Philosophers-PT-000010-LTLFireability-04
FORMULA_NAME Philosophers-PT-000010-LTLFireability-05
FORMULA_NAME Philosophers-PT-000010-LTLFireability-06
FORMULA_NAME Philosophers-PT-000010-LTLFireability-07
FORMULA_NAME Philosophers-PT-000010-LTLFireability-08
FORMULA_NAME Philosophers-PT-000010-LTLFireability-09
FORMULA_NAME Philosophers-PT-000010-LTLFireability-10
FORMULA_NAME Philosophers-PT-000010-LTLFireability-11
FORMULA_NAME Philosophers-PT-000010-LTLFireability-12
FORMULA_NAME Philosophers-PT-000010-LTLFireability-13
FORMULA_NAME Philosophers-PT-000010-LTLFireability-14
FORMULA_NAME Philosophers-PT-000010-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716994127919
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000010
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 14:48:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:48:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:48:51] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-29 14:48:51] [INFO ] Transformed 50 places.
[2024-05-29 14:48:51] [INFO ] Transformed 50 transitions.
[2024-05-29 14:48:51] [INFO ] Found NUPN structural information;
[2024-05-29 14:48:51] [INFO ] Parsed PT model containing 50 places and 50 transitions and 160 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-PT-000010-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 18 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2024-05-29 14:48:51] [INFO ] Computed 20 invariants in 7 ms
[2024-05-29 14:48:52] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-29 14:48:52] [INFO ] Invariant cache hit.
[2024-05-29 14:48:52] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-29 14:48:52] [INFO ] Invariant cache hit.
[2024-05-29 14:48:52] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 588 ms. Remains : 50/50 places, 50/50 transitions.
Support contains 50 out of 50 places after structural reductions.
[2024-05-29 14:48:52] [INFO ] Flatten gal took : 42 ms
[2024-05-29 14:48:52] [INFO ] Flatten gal took : 21 ms
[2024-05-29 14:48:52] [INFO ] Input system was already deterministic with 50 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:48:52] [INFO ] Invariant cache hit.
[2024-05-29 14:48:53] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2024-05-29 14:48:53] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Philosophers-PT-000010-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((p1&&X(p2)))||p0))))'
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:48:53] [INFO ] Invariant cache hit.
[2024-05-29 14:48:53] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 14:48:53] [INFO ] Invariant cache hit.
[2024-05-29 14:48:53] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-29 14:48:53] [INFO ] Invariant cache hit.
[2024-05-29 14:48:53] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 50/50 places, 50/50 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 393 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s7 1) (EQ s18 1)) (AND (EQ s5 1) (EQ s16 1)) (AND (EQ s9 1) (EQ s20 1)) (AND (EQ s4 1) (EQ s13 1)) (AND (EQ s3 1) (EQ s14 1)) (AND (EQ s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 114 steps with 4 reset in 8 ms.
FORMULA Philosophers-PT-000010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-00 finished in 914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:48:54] [INFO ] Invariant cache hit.
[2024-05-29 14:48:54] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 14:48:54] [INFO ] Invariant cache hit.
[2024-05-29 14:48:54] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-29 14:48:54] [INFO ] Invariant cache hit.
[2024-05-29 14:48:54] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (AND (EQ s7 1) (EQ s18 1)) (AND (EQ s5 1) (EQ s16 1)) (AND (EQ s9 1) (EQ s20 1)) (AND (EQ s4 1) (EQ s13 1)) (AND (EQ s3 1) (EQ s14 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-01 finished in 376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||G((p1 U p2)))))'
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 10 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:48:54] [INFO ] Invariant cache hit.
[2024-05-29 14:48:54] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 14:48:54] [INFO ] Invariant cache hit.
[2024-05-29 14:48:54] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-29 14:48:54] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 14:48:54] [INFO ] Invariant cache hit.
[2024-05-29 14:48:54] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (OR (EQ s12 0) (EQ s35 0)) (OR (EQ s13 0) (EQ s33 0)) (OR (EQ s17 0) (EQ s37 0)) (OR (EQ s10 0) (EQ s29 0)) (OR (EQ s16 0) (EQ s34 0)) (OR (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2645 reset in 801 ms.
Product exploration explored 100000 steps with 2630 reset in 433 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 p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 228 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:48:56] [INFO ] Invariant cache hit.
[2024-05-29 14:48:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 8 factoid took 254 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:48:57] [INFO ] Invariant cache hit.
[2024-05-29 14:48:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 14:48:57] [INFO ] Invariant cache hit.
[2024-05-29 14:48:57] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-29 14:48:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:48:57] [INFO ] Invariant cache hit.
[2024-05-29 14:48:57] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 50/50 places, 50/50 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2677 reset in 461 ms.
Product exploration explored 100000 steps with 2628 reset in 411 ms.
Built C files in :
/tmp/ltsmin1411396782075415883
[2024-05-29 14:48:59] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-05-29 14:48:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:48:59] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-05-29 14:48:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:48:59] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-05-29 14:48:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:48:59] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1411396782075415883
Running compilation step : cd /tmp/ltsmin1411396782075415883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 362 ms.
Running link step : cd /tmp/ltsmin1411396782075415883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin1411396782075415883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12389271142088982431.hoa' '--buchi-type=spotba'
LTSmin run took 4055 ms.
FORMULA Philosophers-PT-000010-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-PT-000010-LTLFireability-03 finished in 8945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:49:03] [INFO ] Invariant cache hit.
[2024-05-29 14:49:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 14:49:03] [INFO ] Invariant cache hit.
[2024-05-29 14:49:03] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-29 14:49:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:49:03] [INFO ] Invariant cache hit.
[2024-05-29 14:49:03] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s12 1) (EQ s35 1)) (AND (EQ s13 1) (EQ s33 1)) (AND (EQ s17 1) (EQ s37 1)) (AND (EQ s10 1) (EQ s29 1)) (AND (EQ s16 1) (EQ s34 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 277 steps with 0 reset in 2 ms.
FORMULA Philosophers-PT-000010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-05 finished in 272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:49:03] [INFO ] Invariant cache hit.
[2024-05-29 14:49:04] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 14:49:04] [INFO ] Invariant cache hit.
[2024-05-29 14:49:04] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-29 14:49:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:49:04] [INFO ] Invariant cache hit.
[2024-05-29 14:49:04] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s12 1) (EQ s35 1)) (AND (EQ s13 1) (EQ s33 1)) (AND (EQ s17 1) (EQ s37 1)) (AND (EQ s10 1) (EQ s29 1)) (AND (EQ s16 1) (EQ s34 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 825 steps with 66 reset in 3 ms.
FORMULA Philosophers-PT-000010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-07 finished in 530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p1)))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 42 transition count 42
Applied a total of 16 rules in 16 ms. Remains 42 /50 variables (removed 8) and now considering 42/50 (removed 8) transitions.
// Phase 1: matrix 42 rows 42 cols
[2024-05-29 14:49:04] [INFO ] Computed 20 invariants in 2 ms
[2024-05-29 14:49:04] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-29 14:49:04] [INFO ] Invariant cache hit.
[2024-05-29 14:49:04] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-29 14:49:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:49:04] [INFO ] Invariant cache hit.
[2024-05-29 14:49:04] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/50 places, 42/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 42/50 places, 42/50 transitions.
Stuttering acceptance computed with spot in 128 ms :[p1, true, p1]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s33 1)), p0:(AND (EQ s13 1) (EQ s33 1) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 33 steps with 1 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-08 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X((F(!p1)||G(p0))))) U X(p2)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2024-05-29 14:49:04] [INFO ] Computed 20 invariants in 3 ms
[2024-05-29 14:49:05] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 14:49:05] [INFO ] Invariant cache hit.
[2024-05-29 14:49:05] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-29 14:49:05] [INFO ] Invariant cache hit.
[2024-05-29 14:49:05] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s41 1), p2:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-10 finished in 541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:49:05] [INFO ] Invariant cache hit.
[2024-05-29 14:49:05] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 14:49:05] [INFO ] Invariant cache hit.
[2024-05-29 14:49:05] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-29 14:49:05] [INFO ] Invariant cache hit.
[2024-05-29 14:49:05] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (OR (EQ s5 0) (EQ s16 0)) (EQ s44 0)) (EQ s5 0) (EQ s16 0)), p0:(OR (EQ s5 0) (EQ s16 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-12 finished in 516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(p0 U p1))))))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:49:05] [INFO ] Invariant cache hit.
[2024-05-29 14:49:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-29 14:49:06] [INFO ] Invariant cache hit.
[2024-05-29 14:49:06] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-29 14:49:06] [INFO ] Invariant cache hit.
[2024-05-29 14:49:06] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s3 1) (EQ s14 1)), p1:(AND (EQ s9 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 10436 steps with 2767 reset in 27 ms.
FORMULA Philosophers-PT-000010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-13 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 44 transition count 44
Applied a total of 12 rules in 6 ms. Remains 44 /50 variables (removed 6) and now considering 44/50 (removed 6) transitions.
// Phase 1: matrix 44 rows 44 cols
[2024-05-29 14:49:06] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 14:49:06] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 14:49:06] [INFO ] Invariant cache hit.
[2024-05-29 14:49:06] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-29 14:49:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:49:06] [INFO ] Invariant cache hit.
[2024-05-29 14:49:06] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/50 places, 44/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 44/50 places, 44/50 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s23 1)), p1:(AND (EQ s12 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 58 steps with 1 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-14 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2024-05-29 14:49:06] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 14:49:06] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 14:49:06] [INFO ] Invariant cache hit.
[2024-05-29 14:49:07] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-29 14:49:07] [INFO ] Invariant cache hit.
[2024-05-29 14:49:07] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s11 1) (EQ s30 1)), p0:(AND (EQ s6 1) (EQ s16 1) (EQ s20 1) (EQ s31 1) (OR (EQ s11 0) (EQ s30 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-15 finished in 443 ms.
All properties solved by simple procedures.
Total runtime 16177 ms.
BK_STOP 1716994148351
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is Philosophers-PT-000010, 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 r285-smll-171654422400308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000010.tgz
mv Philosophers-PT-000010 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 '
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 ;