About the Execution of ITS-Tools for Philosophers-PT-000020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1668.604 | 45782.00 | 144873.00 | 184.70 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016500300.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-PT-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016500300
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 25K Apr 29 11:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 29 11:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 29 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 29 11:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K May 9 08:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 9 08:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 9 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 9 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 9 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K May 9 08:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 44K May 10 09:34 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-000020-LTLFireability-00
FORMULA_NAME Philosophers-PT-000020-LTLFireability-01
FORMULA_NAME Philosophers-PT-000020-LTLFireability-02
FORMULA_NAME Philosophers-PT-000020-LTLFireability-03
FORMULA_NAME Philosophers-PT-000020-LTLFireability-04
FORMULA_NAME Philosophers-PT-000020-LTLFireability-05
FORMULA_NAME Philosophers-PT-000020-LTLFireability-06
FORMULA_NAME Philosophers-PT-000020-LTLFireability-07
FORMULA_NAME Philosophers-PT-000020-LTLFireability-08
FORMULA_NAME Philosophers-PT-000020-LTLFireability-09
FORMULA_NAME Philosophers-PT-000020-LTLFireability-10
FORMULA_NAME Philosophers-PT-000020-LTLFireability-11
FORMULA_NAME Philosophers-PT-000020-LTLFireability-12
FORMULA_NAME Philosophers-PT-000020-LTLFireability-13
FORMULA_NAME Philosophers-PT-000020-LTLFireability-14
FORMULA_NAME Philosophers-PT-000020-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652822337753
Running Version 202205111006
[2022-05-17 21:18:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 21:18:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:18:59] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2022-05-17 21:18:59] [INFO ] Transformed 100 places.
[2022-05-17 21:18:59] [INFO ] Transformed 100 transitions.
[2022-05-17 21:18:59] [INFO ] Found NUPN structural information;
[2022-05-17 21:18:59] [INFO ] Parsed PT model containing 100 places and 100 transitions in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:18:59] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-17 21:18:59] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:18:59] [INFO ] Computed 40 place invariants in 6 ms
[2022-05-17 21:18:59] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:18:59] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:18:59] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Support contains 100 out of 100 places after structural reductions.
[2022-05-17 21:18:59] [INFO ] Flatten gal took : 28 ms
[2022-05-17 21:18:59] [INFO ] Flatten gal took : 15 ms
[2022-05-17 21:18:59] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 159 steps, including 0 resets, run visited all 26 properties in 26 ms. (steps per millisecond=6 )
FORMULA Philosophers-PT-000020-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:00] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:19:00] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:00] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:19:00] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:00] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:19:00] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-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 (EQ s37 0) (EQ s58 0)) (OR (EQ s29 0) (EQ s50 0)) (OR (EQ s34 0) (EQ s53 0)) (OR (EQ s24 0) (EQ s41 0)) (OR (EQ s32 0) (EQ s51 0)) (OR (EQ s36...], 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 1 ms.
FORMULA Philosophers-PT-000020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-01 finished in 453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:00] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-17 21:19:00] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:00] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:00] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:00] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:19:00] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s97 1) (EQ s96 1) (EQ s99 1) (EQ s98 1) (EQ s77 1) (EQ s79 1) (EQ s78 1) (EQ s80 1) (EQ s83 1) (EQ s85 1) (EQ s87 1) (EQ s86 1) (EQ s89 1) (EQ ...], 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]]
Product exploration explored 100000 steps with 11201 reset in 580 ms.
Product exploration explored 100000 steps with 11217 reset in 569 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 p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 114 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 291 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:03] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:19:03] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:03] [INFO ] Computed 40 place invariants in 4 ms
[2022-05-17 21:19:03] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:03] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-17 21:19:03] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 105 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 253 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 11222 reset in 429 ms.
Product exploration explored 100000 steps with 11199 reset in 461 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2022-05-17 21:19:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:05] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-17 21:19:05] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Product exploration explored 100000 steps with 11239 reset in 606 ms.
Product exploration explored 100000 steps with 11286 reset in 602 ms.
Built C files in :
/tmp/ltsmin3221787471598912390
[2022-05-17 21:19:06] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3221787471598912390
Running compilation step : cd /tmp/ltsmin3221787471598912390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin3221787471598912390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3221787471598912390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15307096451228690911.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:21] [INFO ] Computed 40 place invariants in 7 ms
[2022-05-17 21:19:21] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:21] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-17 21:19:21] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:21] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:19:21] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin12284085904264361908
[2022-05-17 21:19:21] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12284085904264361908
Running compilation step : cd /tmp/ltsmin12284085904264361908;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 180 ms.
Running link step : cd /tmp/ltsmin12284085904264361908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12284085904264361908;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17359015681988627494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 21:19:37] [INFO ] Flatten gal took : 8 ms
[2022-05-17 21:19:37] [INFO ] Flatten gal took : 9 ms
[2022-05-17 21:19:37] [INFO ] Time to serialize gal into /tmp/LTL12837407785862429529.gal : 2 ms
[2022-05-17 21:19:37] [INFO ] Time to serialize properties into /tmp/LTL16775682567661069306.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12837407785862429529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16775682567661069306.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1283740...268
Read 1 LTL properties
Checking formula 0 : !(((X(G("(((((((Think_6==1)&&(Fork_5==1))||((Think_9==1)&&(Fork_8==1)))||(((Think_16==1)&&(Fork_15==1))||((Think_4==1)&&(Fork_3==1))))...970
Formula 0 simplified : !(XG"(((((((Think_6==1)&&(Fork_5==1))||((Think_9==1)&&(Fork_8==1)))||(((Think_16==1)&&(Fork_15==1))||((Think_4==1)&&(Fork_3==1))))||...961
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
52 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.551357,38696,1,0,97,109130,30,65,2632,153013,174
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Philosophers-PT-000020-LTLFireability-02 finished in 37094 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)||(X(X(p1))&&p2)))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:37] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:37] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:37] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:37] [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.
[2022-05-17 21:19:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:37] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:37] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s37 1) (EQ s57 1)) (AND (EQ s34 1) (EQ s82 1)) (AND (EQ s31 1) (EQ s74 1)) (AND (EQ s39 1) (EQ s81 1)) (AND (EQ s29 1) (EQ s76 1)) (AND (E...], nbAcceptance=2, 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 929 steps with 0 reset in 6 ms.
FORMULA Philosophers-PT-000020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-03 finished in 293 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&X(F(p1))))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:38] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:38] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:38] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:38] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:38] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:38] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (OR (EQ s5 0) (EQ s26 0)) (OR (EQ s3 0) (EQ s24 0)) (OR (EQ s8 0) (EQ s27 0)) (OR (EQ s2 0) (EQ s21 0)) (OR (EQ s0 0) (EQ s19 0)) (OR (EQ s16 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-04 finished in 369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:38] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:38] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:38] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:19:38] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-05-17 21:19:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:38] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:19:38] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (AND (EQ s5 1) (EQ s26 1)) (AND (EQ s3 1) (EQ s24 1)) (AND (EQ s8 1) (EQ s27 1)) (AND (EQ s2 1) (EQ s21 1)) (AND (EQ s0 1) (EQ s19 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][true, true]]
Product exploration explored 100000 steps with 8288 reset in 421 ms.
Stack based approach found an accepted trace after 8693 steps with 686 reset with depth 42 and stack size 42 in 59 ms.
FORMULA Philosophers-PT-000020-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-05 finished in 745 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(((X(p1)&&p0)||G(p2)))&&X(p2)))))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:39] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:39] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:39] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-17 21:19:39] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:39] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:19:39] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p2:(OR (AND (EQ s5 1) (EQ s23 1)) (AND (EQ s8 1) (EQ s28 1)) (AND (EQ s16 1) (EQ s36 1)) (AND (EQ s3 1) (EQ s21 1)) (AND (EQ s18 1) (EQ s34 1)) (AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-06 finished in 473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)&&p0))))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:39] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:39] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:39] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:39] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:39] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:39] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-07 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:(OR (AND (EQ s5 1) (EQ s23 1)) (AND (EQ s8 1) (EQ s28 1)) (AND (EQ s16 1) (EQ s36 1)) (AND (EQ s3 1) (EQ s21 1)) (AND (EQ s18 1) (EQ s34 1)) (AND (EQ s...], 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 23 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-07 finished in 261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!(G((X(p0) U p1)) U !X(p2)))||p0)))'
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:39] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:39] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:39] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:40] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:40] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:40] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s66 1)), p1:(AND (EQ s17 1) (EQ s40 1)), p2:(AND (EQ s19 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9969 steps with 822 reset in 45 ms.
FORMULA Philosophers-PT-000020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-08 finished in 465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(G(p0)))&&X(F(X(G(X(p1)))))))))'
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 85 transition count 85
Applied a total of 30 rules in 13 ms. Remains 85 /100 variables (removed 15) and now considering 85/100 (removed 15) transitions.
// Phase 1: matrix 85 rows 85 cols
[2022-05-17 21:19:40] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:40] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2022-05-17 21:19:40] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:40] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2022-05-17 21:19:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2022-05-17 21:19:40] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:40] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/100 places, 85/100 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/100 places, 85/100 transitions.
Stuttering acceptance computed with spot in 35 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s48 1) (EQ s18 1) (EQ s39 1)), p1:(AND (EQ s20 1) (EQ s40 1))], 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 1386 steps with 0 reset in 9 ms.
FORMULA Philosophers-PT-000020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-09 finished in 262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(X(F((X(p0)||!(p1 U p2))))))))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 83 transition count 83
Applied a total of 34 rules in 13 ms. Remains 83 /100 variables (removed 17) and now considering 83/100 (removed 17) transitions.
// Phase 1: matrix 83 rows 83 cols
[2022-05-17 21:19:40] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:40] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 83 rows 83 cols
[2022-05-17 21:19:40] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:40] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2022-05-17 21:19:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 83 rows 83 cols
[2022-05-17 21:19:40] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:40] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/100 places, 83/100 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/100 places, 83/100 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s27 1) (EQ s45 1)), p0:(EQ s81 0), p1:(EQ s81 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 348 reset in 222 ms.
Stack based approach found an accepted trace after 4492 steps with 14 reset with depth 42 and stack size 41 in 15 ms.
FORMULA Philosophers-PT-000020-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-10 finished in 544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:41] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:41] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:41] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:41] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:41] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:41] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s44 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][false, false]]
Stuttering criterion allowed to conclude after 266 steps with 2 reset in 1 ms.
FORMULA Philosophers-PT-000020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-11 finished in 321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:41] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:41] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:41] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:41] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:41] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:41] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s65 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][false, false]]
Stuttering criterion allowed to conclude after 316 steps with 3 reset in 2 ms.
FORMULA Philosophers-PT-000020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-12 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:41] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:41] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:41] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:41] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:41] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:41] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s28 1) (NEQ s64 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 21219 reset in 410 ms.
Stack based approach found an accepted trace after 1199 steps with 255 reset with depth 14 and stack size 14 in 5 ms.
FORMULA Philosophers-PT-000020-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-13 finished in 758 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(!F(p0))) U G((p1||(F(p0)&&p2)))))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 85 transition count 85
Applied a total of 30 rules in 13 ms. Remains 85 /100 variables (removed 15) and now considering 85/100 (removed 15) transitions.
// Phase 1: matrix 85 rows 85 cols
[2022-05-17 21:19:42] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:42] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2022-05-17 21:19:42] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:42] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-05-17 21:19:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2022-05-17 21:19:42] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:19:42] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/100 places, 85/100 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/100 places, 85/100 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), p0, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s84 1), p2:(AND (EQ s3 1) (EQ s24 1)), p0:(AND (EQ s25 1) (EQ s47 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 415 steps with 6 reset in 3 ms.
FORMULA Philosophers-PT-000020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-14 finished in 320 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((F(X(X(p0)))||F(p1)))) U X(p0)))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:42] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:42] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:42] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:42] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:19:42] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:19:43] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s46 1)), p1:(NEQ s87 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]]
Product exploration explored 100000 steps with 876 reset in 203 ms.
Stack based approach found an accepted trace after 2646 steps with 25 reset with depth 44 and stack size 44 in 6 ms.
FORMULA Philosophers-PT-000020-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-15 finished in 620 ms.
All properties solved by simple procedures.
Total runtime 44621 ms.
BK_STOP 1652822383535
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-000020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000020, 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 r168-tall-165277016500300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 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 ;