About the Execution of ITS-Tools for Philosophers-PT-000200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6345.376 | 3600000.00 | 3937182.00 | 16449.20 | ?TFFFFTTFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945100228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Philosophers-PT-000200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945100228
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 171K Feb 25 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 960K Feb 25 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 117K Feb 25 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 762K Feb 25 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 75K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 295K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 332K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 310K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 261K Feb 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 445K Mar 5 18:23 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-000200-LTLFireability-00
FORMULA_NAME Philosophers-PT-000200-LTLFireability-01
FORMULA_NAME Philosophers-PT-000200-LTLFireability-02
FORMULA_NAME Philosophers-PT-000200-LTLFireability-03
FORMULA_NAME Philosophers-PT-000200-LTLFireability-04
FORMULA_NAME Philosophers-PT-000200-LTLFireability-05
FORMULA_NAME Philosophers-PT-000200-LTLFireability-06
FORMULA_NAME Philosophers-PT-000200-LTLFireability-07
FORMULA_NAME Philosophers-PT-000200-LTLFireability-08
FORMULA_NAME Philosophers-PT-000200-LTLFireability-09
FORMULA_NAME Philosophers-PT-000200-LTLFireability-10
FORMULA_NAME Philosophers-PT-000200-LTLFireability-11
FORMULA_NAME Philosophers-PT-000200-LTLFireability-12
FORMULA_NAME Philosophers-PT-000200-LTLFireability-13
FORMULA_NAME Philosophers-PT-000200-LTLFireability-14
FORMULA_NAME Philosophers-PT-000200-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678808391834
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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000200
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-14 15:39:53] [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]
[2023-03-14 15:39:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:39:53] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-14 15:39:53] [INFO ] Transformed 1000 places.
[2023-03-14 15:39:53] [INFO ] Transformed 1000 transitions.
[2023-03-14 15:39:53] [INFO ] Parsed PT model containing 1000 places and 1000 transitions and 3200 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-000200-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 804 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 33 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 15:39:53] [INFO ] Computed 400 place invariants in 32 ms
[2023-03-14 15:39:54] [INFO ] Implicit Places using invariants in 1301 ms returned []
[2023-03-14 15:39:54] [INFO ] Invariant cache hit.
[2023-03-14 15:39:55] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
[2023-03-14 15:39:55] [INFO ] Invariant cache hit.
[2023-03-14 15:39:55] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2343 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 804 out of 1000 places after structural reductions.
[2023-03-14 15:39:56] [INFO ] Flatten gal took : 111 ms
[2023-03-14 15:39:56] [INFO ] Flatten gal took : 72 ms
[2023-03-14 15:39:56] [INFO ] Input system was already deterministic with 1000 transitions.
Finished random walk after 2708 steps, including 0 resets, run visited all 21 properties in 151 ms. (steps per millisecond=17 )
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 38 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 15:39:57] [INFO ] Invariant cache hit.
[2023-03-14 15:39:57] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-14 15:39:57] [INFO ] Invariant cache hit.
[2023-03-14 15:39:58] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2023-03-14 15:39:58] [INFO ] Invariant cache hit.
[2023-03-14 15:39:58] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1262 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s282 1) (GEQ s454 1)) (AND (GEQ s333 1) (GEQ s551 1)) (AND (GEQ s277 1) (GEQ s457 1)) (AND (GEQ s338 1) (GEQ s556 1)) (AND (GEQ s406 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 33092 reset in 6001 ms.
Product exploration explored 100000 steps with 33080 reset in 6169 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 (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 2 factoid took 340 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2660 steps, including 0 resets, run visited all 3 properties in 44 ms. (steps per millisecond=60 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 15:40:14] [INFO ] Invariant cache hit.
[2023-03-14 15:40:15] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-14 15:40:15] [INFO ] Invariant cache hit.
[2023-03-14 15:40:15] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-03-14 15:40:15] [INFO ] Invariant cache hit.
[2023-03-14 15:40:16] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1237 ms. Remains : 1000/1000 places, 1000/1000 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 (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 5097 steps, including 1 resets, run visited all 3 properties in 80 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (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 2 factoid took 365 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33211 reset in 5311 ms.
Product exploration explored 100000 steps with 33165 reset in 5498 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 39 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 15:40:29] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-14 15:40:29] [INFO ] Invariant cache hit.
[2023-03-14 15:40:30] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 581 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin11959110517078676537
[2023-03-14 15:40:30] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11959110517078676537
Running compilation step : cd /tmp/ltsmin11959110517078676537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2269 ms.
Running link step : cd /tmp/ltsmin11959110517078676537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin11959110517078676537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9029572309998558533.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 15:40:45] [INFO ] Invariant cache hit.
[2023-03-14 15:40:45] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-14 15:40:45] [INFO ] Invariant cache hit.
[2023-03-14 15:40:45] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-03-14 15:40:45] [INFO ] Invariant cache hit.
[2023-03-14 15:40:46] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1201 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin4691667431708882821
[2023-03-14 15:40:46] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4691667431708882821
Running compilation step : cd /tmp/ltsmin4691667431708882821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4691667431708882821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4691667431708882821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-14 15:40:51] [INFO ] Flatten gal took : 42 ms
[2023-03-14 15:40:51] [INFO ] Flatten gal took : 42 ms
[2023-03-14 15:40:51] [INFO ] Time to serialize gal into /tmp/LTL13062374204999676700.gal : 16 ms
[2023-03-14 15:40:51] [INFO ] Time to serialize properties into /tmp/LTL11187415725990697995.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13062374204999676700.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8338868210142305290.hoa' '-atoms' '/tmp/LTL11187415725990697995.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11187415725990697995.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8338868210142305290.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2023-03-14 15:41:06] [INFO ] Flatten gal took : 42 ms
[2023-03-14 15:41:06] [INFO ] Flatten gal took : 37 ms
[2023-03-14 15:41:06] [INFO ] Time to serialize gal into /tmp/LTL1202775143661716384.gal : 5 ms
[2023-03-14 15:41:06] [INFO ] Time to serialize properties into /tmp/LTL16789185827607418141.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1202775143661716384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16789185827607418141.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((((((((((Think_95>=1)&&(Fork_94>=1))||((Think_158>=1)&&(Fork_157>=1)))||(((Think_98>=1)&&(Fork_97>=1))||((Think_77>=1)&&(F...13808
Formula 0 simplified : X(XF!"((((((((((Think_95>=1)&&(Fork_94>=1))||((Think_158>=1)&&(Fork_157>=1)))||(((Think_98>=1)&&(Fork_97>=1))||((Think_77>=1)&&(Fork...13798
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2023-03-14 15:41:21] [INFO ] Flatten gal took : 35 ms
[2023-03-14 15:41:21] [INFO ] Applying decomposition
[2023-03-14 15:41:21] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6635412077536287484.txt' '-o' '/tmp/graph6635412077536287484.bin' '-w' '/tmp/graph6635412077536287484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6635412077536287484.bin' '-l' '-1' '-v' '-w' '/tmp/graph6635412077536287484.weights' '-q' '0' '-e' '0.001'
[2023-03-14 15:41:22] [INFO ] Decomposing Gal with order
[2023-03-14 15:41:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 15:41:22] [INFO ] Removed a total of 199 redundant transitions.
[2023-03-14 15:41:22] [INFO ] Flatten gal took : 93 ms
[2023-03-14 15:41:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 608 labels/synchronizations in 23 ms.
[2023-03-14 15:41:22] [INFO ] Time to serialize gal into /tmp/LTL2707703174739058100.gal : 10 ms
[2023-03-14 15:41:22] [INFO ] Time to serialize properties into /tmp/LTL12498605604514062335.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2707703174739058100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12498605604514062335.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((((((((((i15.i1.i0.u87.Think_95>=1)&&(i15.i1.i0.u87.Fork_94>=1))||((i18.i1.i0.u111.Think_158>=1)&&(i18.i1.i0.u111.Fork_157...23232
Formula 0 simplified : X(XF!"((((((((((i15.i1.i0.u87.Think_95>=1)&&(i15.i1.i0.u87.Fork_94>=1))||((i18.i1.i0.u111.Think_158>=1)&&(i18.i1.i0.u111.Fork_157>=1...23222
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin127213937650101998
[2023-03-14 15:41:37] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin127213937650101998
Running compilation step : cd /tmp/ltsmin127213937650101998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1705 ms.
Running link step : cd /tmp/ltsmin127213937650101998;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin127213937650101998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Philosophers-PT-000200-LTLFireability-00 finished in 115272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(!p2)&&p1))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 15:41:52] [INFO ] Invariant cache hit.
[2023-03-14 15:41:52] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-14 15:41:52] [INFO ] Invariant cache hit.
[2023-03-14 15:41:53] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2023-03-14 15:41:53] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-14 15:41:53] [INFO ] Invariant cache hit.
[2023-03-14 15:41:53] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1069 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, (NOT p0), p2, (OR (NOT p1) p2)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s366 1) (GEQ s729 1)) (AND (GEQ s271 1) (GEQ s698 1)) (AND (GEQ s371 1) (GEQ s726 1)) (AND (GEQ s321 1) (GEQ s716 1)) (AND (GEQ s218 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-03 finished in 1278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0))&&F(((p2 U X(p2))||p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 15:41:53] [INFO ] Invariant cache hit.
[2023-03-14 15:41:54] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-14 15:41:54] [INFO ] Invariant cache hit.
[2023-03-14 15:41:54] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2023-03-14 15:41:54] [INFO ] Invariant cache hit.
[2023-03-14 15:41:55] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1195 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s58 1) (GEQ s273 1)) (AND (GEQ s194 1) (GEQ s391 1)) (AND (GEQ s14 1) (GEQ s209 1)) (AND (GEQ s51 1) (GEQ s240 1)) (AND (GEQ s187 1) (GEQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 73 reset in 1329 ms.
Stack based approach found an accepted trace after 424 steps with 0 reset with depth 425 and stack size 425 in 12 ms.
FORMULA Philosophers-PT-000200-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-04 finished in 2669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(!p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 15:41:56] [INFO ] Invariant cache hit.
[2023-03-14 15:41:56] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-14 15:41:56] [INFO ] Invariant cache hit.
[2023-03-14 15:41:57] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2023-03-14 15:41:57] [INFO ] Invariant cache hit.
[2023-03-14 15:41:57] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1240 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s366 1) (GEQ s729 1)) (AND (GEQ s271 1) (GEQ s698 1)) (AND (GEQ s371 1) (GEQ s726 1)) (AND (GEQ s321 1) (GEQ s716 1)) (AND (GEQ s218 1) (...], 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 3 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-05 finished in 1397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p0)||X(p1)))||((G(p0)||X(p1))&&G(F(!p2))))))'
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 46 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 15:41:58] [INFO ] Invariant cache hit.
[2023-03-14 15:41:58] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-14 15:41:58] [INFO ] Invariant cache hit.
[2023-03-14 15:41:59] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
[2023-03-14 15:41:59] [INFO ] Invariant cache hit.
[2023-03-14 15:41:59] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1748 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(NOT p1), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=p2, acceptance={0} source=9 dest: 9}], [{ cond=p2, acceptance={} source=10 dest: 9}, { cond=true, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 10}, { cond=(AND p0 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (GEQ s161 1) (GEQ s351 1)), p1:(LT s767 1), p2:(OR (GEQ s770 1) (AND (GEQ s241 1) (GEQ s474 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25098 reset in 4515 ms.
Product exploration explored 100000 steps with 25031 reset in 4675 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 p1 (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 345 ms. Reduced automaton from 12 states, 24 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Finished random walk after 486 steps, including 0 resets, run visited all 10 properties in 23 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F p2), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND p2 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND p2 (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 578 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 468 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 435 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 26 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 15:42:12] [INFO ] Invariant cache hit.
[2023-03-14 15:42:13] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-14 15:42:13] [INFO ] Invariant cache hit.
[2023-03-14 15:42:13] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
[2023-03-14 15:42:13] [INFO ] Invariant cache hit.
[2023-03-14 15:42:14] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1763 ms. Remains : 1000/1000 places, 1000/1000 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 p1 (NOT p2)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 254 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 467 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Finished random walk after 3494 steps, including 1 resets, run visited all 10 properties in 60 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F p2), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 487 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 432 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 420 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 406 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Product exploration explored 100000 steps with 25066 reset in 4472 ms.
Entered a terminal (fully accepting) state of product in 64098 steps with 15947 reset in 3007 ms.
FORMULA Philosophers-PT-000200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-08 finished in 27314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(X((p1||X(F(p2))))))))'
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 26 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 15:42:25] [INFO ] Invariant cache hit.
[2023-03-14 15:42:25] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-14 15:42:25] [INFO ] Invariant cache hit.
[2023-03-14 15:42:26] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
[2023-03-14 15:42:26] [INFO ] Invariant cache hit.
[2023-03-14 15:42:27] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1764 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s207 1) (GEQ s218 1) (GEQ s384 1)), p1:(LT s852 1), p2:(OR (LT s38 1) (LT s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 581 ms.
Stack based approach found an accepted trace after 1722 steps with 0 reset with depth 1723 and stack size 1723 in 27 ms.
FORMULA Philosophers-PT-000200-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-09 finished in 2860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 802 transition count 802
Applied a total of 396 rules in 126 ms. Remains 802 /1000 variables (removed 198) and now considering 802/1000 (removed 198) transitions.
// Phase 1: matrix 802 rows 802 cols
[2023-03-14 15:42:28] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-14 15:42:28] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-14 15:42:28] [INFO ] Invariant cache hit.
[2023-03-14 15:42:29] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2023-03-14 15:42:29] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-14 15:42:29] [INFO ] Invariant cache hit.
[2023-03-14 15:42:29] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/1000 places, 802/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1755 ms. Remains : 802/1000 places, 802/1000 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-11 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 (LT s363 1) (LT s794 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 752 ms.
Stack based approach found an accepted trace after 1008 steps with 0 reset with depth 1009 and stack size 1008 in 27 ms.
FORMULA Philosophers-PT-000200-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-11 finished in 2593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 196
Deduced a syphon composed of 196 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 0 with 392 rules applied. Total rules applied 392 place count 804 transition count 804
Applied a total of 392 rules in 63 ms. Remains 804 /1000 variables (removed 196) and now considering 804/1000 (removed 196) transitions.
// Phase 1: matrix 804 rows 804 cols
[2023-03-14 15:42:30] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-14 15:42:31] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-14 15:42:31] [INFO ] Invariant cache hit.
[2023-03-14 15:42:32] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
[2023-03-14 15:42:32] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 15:42:32] [INFO ] Invariant cache hit.
[2023-03-14 15:42:32] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 804/1000 places, 804/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1620 ms. Remains : 804/1000 places, 804/1000 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-12 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 (GEQ s197 1) (GEQ s403 1)), p1:(AND (GEQ s249 1) (GEQ s415 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 675 ms.
Stack based approach found an accepted trace after 313 steps with 0 reset with depth 314 and stack size 313 in 12 ms.
FORMULA Philosophers-PT-000200-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-12 finished in 2429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 802 transition count 802
Applied a total of 396 rules in 56 ms. Remains 802 /1000 variables (removed 198) and now considering 802/1000 (removed 198) transitions.
// Phase 1: matrix 802 rows 802 cols
[2023-03-14 15:42:33] [INFO ] Computed 400 place invariants in 6 ms
[2023-03-14 15:42:33] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-14 15:42:33] [INFO ] Invariant cache hit.
[2023-03-14 15:42:34] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
[2023-03-14 15:42:34] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-14 15:42:34] [INFO ] Invariant cache hit.
[2023-03-14 15:42:34] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/1000 places, 802/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1645 ms. Remains : 802/1000 places, 802/1000 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s192 1) (GEQ s393 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 12849 steps with 0 reset in 116 ms.
FORMULA Philosophers-PT-000200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-13 finished in 1810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F((p0||G(F(p0)))))||(p1&&G(p2))))))'
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 15:42:35] [INFO ] Computed 400 place invariants in 13 ms
[2023-03-14 15:42:35] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-14 15:42:35] [INFO ] Invariant cache hit.
[2023-03-14 15:42:36] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2023-03-14 15:42:36] [INFO ] Invariant cache hit.
[2023-03-14 15:42:36] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1704 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (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)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s51 1) (LT s239 1)), p2:(LT s891 1), p0:(AND (GEQ s165 1) (GEQ s380 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]]
Product exploration explored 100000 steps with 57 reset in 1207 ms.
Stack based approach found an accepted trace after 9509 steps with 2 reset with depth 2647 and stack size 2643 in 109 ms.
FORMULA Philosophers-PT-000200-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-14 finished in 3320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 15:42:38] [INFO ] Invariant cache hit.
[2023-03-14 15:42:38] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-14 15:42:38] [INFO ] Invariant cache hit.
[2023-03-14 15:42:39] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2023-03-14 15:42:39] [INFO ] Invariant cache hit.
[2023-03-14 15:42:40] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1747 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s130 1) (LT s321 1)), p1:(AND (GEQ s147 1) (GEQ s367 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 1023 reset in 4175 ms.
Stack based approach found an accepted trace after 34827 steps with 385 reset with depth 296 and stack size 296 in 1521 ms.
FORMULA Philosophers-PT-000200-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-15 finished in 7600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
[2023-03-14 15:42:46] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17299670896556118035
[2023-03-14 15:42:46] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-14 15:42:46] [INFO ] Applying decomposition
[2023-03-14 15:42:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 15:42:46] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-14 15:42:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 15:42:46] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14913651574698304125.txt' '-o' '/tmp/graph14913651574698304125.bin' '-w' '/tmp/graph14913651574698304125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14913651574698304125.bin' '-l' '-1' '-v' '-w' '/tmp/graph14913651574698304125.weights' '-q' '0' '-e' '0.001'
[2023-03-14 15:42:46] [INFO ] Decomposing Gal with order
[2023-03-14 15:42:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 15:42:46] [INFO ] Removed a total of 198 redundant transitions.
[2023-03-14 15:42:46] [INFO ] Flatten gal took : 61 ms
[2023-03-14 15:42:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 546 labels/synchronizations in 12 ms.
[2023-03-14 15:42:46] [INFO ] Time to serialize gal into /tmp/LTLFireability9163115598141159988.gal : 7 ms
[2023-03-14 15:42:46] [INFO ] Time to serialize properties into /tmp/LTLFireability12272662149755834288.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9163115598141159988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12272662149755834288.ltl' '-c' '-stutter-deadlock'
[2023-03-14 15:42:46] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
[2023-03-14 15:42:46] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 15:42:46] [INFO ] Built C files in 415ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17299670896556118035
Running compilation step : cd /tmp/ltsmin17299670896556118035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((X((X(G("((((((((((i22.u180.Think_95>=1)&&(i22.u180.Fork_94>=1))||((i28.u23.Think_158>=1)&&(i23.i1.i0.u152.Fork_157>=1)))||(((i11.i0...22048
Formula 0 simplified : X(XF!"((((((((((i22.u180.Think_95>=1)&&(i22.u180.Fork_94>=1))||((i28.u23.Think_158>=1)&&(i23.i1.i0.u152.Fork_157>=1)))||(((i11.i0.i0...22038
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Compilation finished in 2852 ms.
Running link step : cd /tmp/ltsmin17299670896556118035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17299670896556118035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.283: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.283: LTL layer: formula: X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))
pins2lts-mc-linux64( 7/ 8), 0.283: "X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.284: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.323: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.326: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.330: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.330: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.331: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.330: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.337: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.347: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.669: DFS-FIFO for weak LTL, using special progress label 1003
pins2lts-mc-linux64( 0/ 8), 0.669: There are 1004 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.669: State length is 1001, there are 1005 groups
pins2lts-mc-linux64( 0/ 8), 0.669: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.669: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.669: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.669: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.666: ~1 levels ~960 states ~143216 transitions
pins2lts-mc-linux64( 2/ 8), 1.806: ~1 levels ~1920 states ~168768 transitions
pins2lts-mc-linux64( 2/ 8), 1.945: ~1 levels ~3840 states ~178288 transitions
pins2lts-mc-linux64( 2/ 8), 2.331: ~1 levels ~7680 states ~219488 transitions
pins2lts-mc-linux64( 2/ 8), 3.406: ~1 levels ~15360 states ~396936 transitions
pins2lts-mc-linux64( 2/ 8), 5.976: ~1 levels ~30720 states ~1087632 transitions
pins2lts-mc-linux64( 2/ 8), 13.774: ~1 levels ~61440 states ~3872416 transitions
pins2lts-mc-linux64( 7/ 8), 24.788: ~1 levels ~122880 states ~7352008 transitions
pins2lts-mc-linux64( 0/ 8), 41.861: ~1 levels ~245760 states ~12379960 transitions
pins2lts-mc-linux64( 2/ 8), 57.147: ~1 levels ~491520 states ~13863032 transitions
pins2lts-mc-linux64( 4/ 8), 63.395: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 70.948:
pins2lts-mc-linux64( 0/ 8), 70.948: mean standard work distribution: 31.0% (states) 14.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 70.948:
pins2lts-mc-linux64( 0/ 8), 70.948: Explored 348355 states 16415167 transitions, fanout: 47.122
pins2lts-mc-linux64( 0/ 8), 70.948: Total exploration time 70.260 sec (63.350 sec minimum, 67.436 sec on average)
pins2lts-mc-linux64( 0/ 8), 70.948: States per second: 4958, Transitions per second: 233635
pins2lts-mc-linux64( 0/ 8), 70.948:
pins2lts-mc-linux64( 0/ 8), 70.948: Progress states detected: 12188147
pins2lts-mc-linux64( 0/ 8), 70.948: Redundant explorations: -97.1420
pins2lts-mc-linux64( 0/ 8), 70.948:
pins2lts-mc-linux64( 0/ 8), 70.948: Queue width: 8B, total height: 17132733, memory: 130.71MB
pins2lts-mc-linux64( 0/ 8), 70.948: Tree memory: 349.0MB, 30.0 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 70.948: Tree fill ratio (roots/leafs): 9.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 70.948: Stored 1029 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 70.948: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 70.948: Est. total memory use: 479.7MB (~1154.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17299670896556118035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17299670896556118035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-14 16:03:43] [INFO ] Flatten gal took : 31 ms
[2023-03-14 16:03:43] [INFO ] Time to serialize gal into /tmp/LTLFireability17762251395716101387.gal : 5 ms
[2023-03-14 16:03:43] [INFO ] Time to serialize properties into /tmp/LTLFireability938209754170150631.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17762251395716101387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability938209754170150631.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((((((((((Think_95>=1)&&(Fork_94>=1))||((Think_158>=1)&&(Fork_157>=1)))||(((Think_98>=1)&&(Fork_97>=1))||((Think_77>=1)&&(F...13808
Formula 0 simplified : X(XF!"((((((((((Think_95>=1)&&(Fork_94>=1))||((Think_158>=1)&&(Fork_157>=1)))||(((Think_98>=1)&&(Fork_97>=1))||((Think_77>=1)&&(Fork...13798
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2023-03-14 16:24:40] [INFO ] Flatten gal took : 30 ms
[2023-03-14 16:24:40] [INFO ] Input system was already deterministic with 1000 transitions.
[2023-03-14 16:24:40] [INFO ] Transformed 1000 places.
[2023-03-14 16:24:40] [INFO ] Transformed 1000 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-14 16:24:41] [INFO ] Time to serialize gal into /tmp/LTLFireability4920123344061921683.gal : 5 ms
[2023-03-14 16:24:41] [INFO ] Time to serialize properties into /tmp/LTLFireability1866084817919966254.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4920123344061921683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1866084817919966254.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X(G("((((((((((Think_95>=1)&&(Fork_94>=1))||((Think_158>=1)&&(Fork_157>=1)))||(((Think_98>=1)&&(Fork_97>=1))||((Think_77>=1)&&(F...13808
Formula 0 simplified : X(XF!"((((((((((Think_95>=1)&&(Fork_94>=1))||((Think_158>=1)&&(Fork_157>=1)))||(((Think_98>=1)&&(Fork_97>=1))||((Think_77>=1)&&(Fork...13798
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11675224 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16030120 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-000200"
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-5348"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000200, 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 r293-tall-167873945100228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000200.tgz
mv Philosophers-PT-000200 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 ;