About the Execution of ITS-Tools for PhilosophersDyn-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11171.668 | 477941.00 | 1004177.00 | 18795.30 | FTTFFTTFFFFFFFFF | 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-167873945300324.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 PhilosophersDyn-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945300324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 39K Feb 26 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 195K Feb 26 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 288K Feb 26 12:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 26 12:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 537K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 443K Feb 26 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.5M Feb 26 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 PhilosophersDyn-PT-10-LTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678827133101
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=PhilosophersDyn-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-14 20:52:15] [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 20:52:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 20:52:15] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-14 20:52:15] [INFO ] Transformed 170 places.
[2023-03-14 20:52:15] [INFO ] Transformed 2310 transitions.
[2023-03-14 20:52:15] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2023-03-14 20:52:15] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 20:52:15] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 20:52:15] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 20:52:15] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 20:52:15] [INFO ] Reduced 89 identical enabling conditions.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA PhilosophersDyn-PT-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 154 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 37 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2023-03-14 20:52:16] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2023-03-14 20:52:16] [INFO ] Computed 39 place invariants in 84 ms
[2023-03-14 20:52:17] [INFO ] Dead Transitions using invariants and state equation in 1131 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:52:17] [INFO ] Computed 39 place invariants in 52 ms
[2023-03-14 20:52:17] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-14 20:52:17] [INFO ] Invariant cache hit.
[2023-03-14 20:52:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:52:18] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 20 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2692 ms. Remains : 170/170 places, 1885/2265 transitions.
Support contains 154 out of 170 places after structural reductions.
[2023-03-14 20:52:19] [INFO ] Flatten gal took : 279 ms
[2023-03-14 20:52:19] [INFO ] Flatten gal took : 211 ms
[2023-03-14 20:52:20] [INFO ] Input system was already deterministic with 1885 transitions.
Incomplete random walk after 10000 steps, including 1197 resets, run finished after 1116 ms. (steps per millisecond=8 ) properties (out of 25) seen :20
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-14 20:52:21] [INFO ] Invariant cache hit.
[2023-03-14 20:52:21] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 2 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
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(F((F(p1)&&p0))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:52:22] [INFO ] Invariant cache hit.
[2023-03-14 20:52:22] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
[2023-03-14 20:52:22] [INFO ] Invariant cache hit.
[2023-03-14 20:52:22] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-14 20:52:22] [INFO ] Invariant cache hit.
[2023-03-14 20:52:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:52:25] [INFO ] Implicit Places using invariants and state equation in 2202 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
[2023-03-14 20:52:25] [INFO ] Invariant cache hit.
[2023-03-14 20:52:25] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3584 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 2594 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s19 1) (GEQ s43 1) (GEQ s63 1) (GEQ s83 1) (GEQ s107 1) (GEQ s115 1) (GEQ s152 1) (GEQ s153 1) (GEQ s155 1)), p0:(AND (OR (LT s5 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 3 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-00 finished in 6250 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 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 220 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:52:28] [INFO ] Invariant cache hit.
[2023-03-14 20:52:29] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
[2023-03-14 20:52:29] [INFO ] Invariant cache hit.
[2023-03-14 20:52:29] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-14 20:52:29] [INFO ] Invariant cache hit.
[2023-03-14 20:52:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:52:36] [INFO ] Implicit Places using invariants and state equation in 6862 ms returned []
Implicit Place search using SMT with State Equation took 7185 ms to find 0 implicit places.
[2023-03-14 20:52:36] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-14 20:52:36] [INFO ] Invariant cache hit.
[2023-03-14 20:52:37] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8834 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 54 ms :[p0]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s19 1) (GEQ s43 1) (GEQ s63 1) (GEQ s83 1) (GEQ s107 1) (GEQ s115 1) (GEQ s152 1) (GEQ s153 1) (GEQ s155 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 11969 reset in 1156 ms.
Product exploration explored 100000 steps with 11968 reset in 1102 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 399 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 637 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[p0]
Stuttering acceptance computed with spot in 41 ms :[p0]
[2023-03-14 20:52:40] [INFO ] Invariant cache hit.
[2023-03-14 20:52:41] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-14 20:52:41] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-14 20:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:52:41] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2023-03-14 20:52:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:52:41] [INFO ] [Real]Added 1010 Read/Feed constraints in 106 ms returned sat
[2023-03-14 20:52:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 270 ms.
[2023-03-14 20:52:42] [INFO ] Added : 0 causal constraints over 0 iterations in 426 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 156 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:52:42] [INFO ] Invariant cache hit.
[2023-03-14 20:52:43] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
[2023-03-14 20:52:43] [INFO ] Invariant cache hit.
[2023-03-14 20:52:43] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-14 20:52:43] [INFO ] Invariant cache hit.
[2023-03-14 20:52:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:52:50] [INFO ] Implicit Places using invariants and state equation in 6897 ms returned []
Implicit Place search using SMT with State Equation took 7185 ms to find 0 implicit places.
[2023-03-14 20:52:50] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-14 20:52:50] [INFO ] Invariant cache hit.
[2023-03-14 20:52:51] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8713 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 907 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
[2023-03-14 20:52:52] [INFO ] Invariant cache hit.
[2023-03-14 20:52:53] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:52:53] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 18 ms returned sat
[2023-03-14 20:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:52:53] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2023-03-14 20:52:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:52:53] [INFO ] [Real]Added 1010 Read/Feed constraints in 113 ms returned sat
[2023-03-14 20:52:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 176 ms.
[2023-03-14 20:52:54] [INFO ] Added : 0 causal constraints over 0 iterations in 309 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 36 ms :[p0]
Product exploration explored 100000 steps with 11923 reset in 1060 ms.
Product exploration explored 100000 steps with 11949 reset in 1059 ms.
Built C files in :
/tmp/ltsmin5416156991159968477
[2023-03-14 20:52:56] [INFO ] Too many transitions (1885) to apply POR reductions. Disabling POR matrices.
[2023-03-14 20:52:56] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5416156991159968477
Running compilation step : cd /tmp/ltsmin5416156991159968477;'/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/ltsmin5416156991159968477;'/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/ltsmin5416156991159968477;'/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)
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 128 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:52:59] [INFO ] Invariant cache hit.
[2023-03-14 20:53:00] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
[2023-03-14 20:53:00] [INFO ] Invariant cache hit.
[2023-03-14 20:53:00] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-14 20:53:00] [INFO ] Invariant cache hit.
[2023-03-14 20:53:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:53:07] [INFO ] Implicit Places using invariants and state equation in 6787 ms returned []
Implicit Place search using SMT with State Equation took 7077 ms to find 0 implicit places.
[2023-03-14 20:53:07] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-14 20:53:07] [INFO ] Invariant cache hit.
[2023-03-14 20:53:08] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8531 ms. Remains : 170/170 places, 1885/1885 transitions.
Built C files in :
/tmp/ltsmin14081504326096454857
[2023-03-14 20:53:10] [INFO ] Too many transitions (1885) to apply POR reductions. Disabling POR matrices.
[2023-03-14 20:53:10] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14081504326096454857
Running compilation step : cd /tmp/ltsmin14081504326096454857;'/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/ltsmin14081504326096454857;'/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/ltsmin14081504326096454857;'/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 20:53:13] [INFO ] Flatten gal took : 124 ms
[2023-03-14 20:53:13] [INFO ] Flatten gal took : 100 ms
[2023-03-14 20:53:13] [INFO ] Time to serialize gal into /tmp/LTL13633945471164594826.gal : 25 ms
[2023-03-14 20:53:13] [INFO ] Time to serialize properties into /tmp/LTL16953651571784202513.prop : 0 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/LTL13633945471164594826.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17164855911664091697.hoa' '-atoms' '/tmp/LTL16953651571784202513.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...320
Loading property file /tmp/LTL16953651571784202513.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17164855911664091697.hoa
Detected timeout of ITS tools.
[2023-03-14 20:53:29] [INFO ] Flatten gal took : 86 ms
[2023-03-14 20:53:29] [INFO ] Flatten gal took : 88 ms
[2023-03-14 20:53:29] [INFO ] Time to serialize gal into /tmp/LTL13120318588617052440.gal : 16 ms
[2023-03-14 20:53:29] [INFO ] Time to serialize properties into /tmp/LTL3558526841563224032.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/LTL13120318588617052440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3558526841563224032.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 : !((F(G("(((((Outside_10<1)||(Outside_4<1))||((Outside_3<1)||(Outside_5<1)))||(((Outside_6<1)||(Outside_7<1))||((Outside_8<1)||(Outside...201
Formula 0 simplified : GF!"(((((Outside_10<1)||(Outside_4<1))||((Outside_3<1)||(Outside_5<1)))||(((Outside_6<1)||(Outside_7<1))||((Outside_8<1)||(Outside_9...195
Detected timeout of ITS tools.
[2023-03-14 20:53:44] [INFO ] Flatten gal took : 77 ms
[2023-03-14 20:53:44] [INFO ] Applying decomposition
[2023-03-14 20:53:44] [INFO ] Flatten gal took : 80 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/graph11171063955096801407.txt' '-o' '/tmp/graph11171063955096801407.bin' '-w' '/tmp/graph11171063955096801407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11171063955096801407.bin' '-l' '-1' '-v' '-w' '/tmp/graph11171063955096801407.weights' '-q' '0' '-e' '0.001'
[2023-03-14 20:53:44] [INFO ] Decomposing Gal with order
[2023-03-14 20:53:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 20:53:45] [INFO ] Removed a total of 2687 redundant transitions.
[2023-03-14 20:53:45] [INFO ] Flatten gal took : 614 ms
[2023-03-14 20:53:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 26 ms.
[2023-03-14 20:53:45] [INFO ] Time to serialize gal into /tmp/LTL10719866529430066468.gal : 25 ms
[2023-03-14 20:53:45] [INFO ] Time to serialize properties into /tmp/LTL7304852498811560507.ltl : 1 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/LTL10719866529430066468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7304852498811560507.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 : !((F(G("(((((u0.Outside_10<1)||(i7.u2.Outside_4<1))||((i3.u6.Outside_3<1)||(i9.u11.Outside_5<1)))||(((i6.u10.Outside_6<1)||(i8.u7.Outs...261
Formula 0 simplified : GF!"(((((u0.Outside_10<1)||(i7.u2.Outside_4<1))||((i3.u6.Outside_3<1)||(i9.u11.Outside_5<1)))||(((i6.u10.Outside_6<1)||(i8.u7.Outsid...255
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15589802401162711515
[2023-03-14 20:54:00] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15589802401162711515
Running compilation step : cd /tmp/ltsmin15589802401162711515;'/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/ltsmin15589802401162711515;'/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/ltsmin15589802401162711515;'/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)
Treatment of property PhilosophersDyn-PT-10-LTLFireability-01 finished in 95563 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((F(p1)||p0))))'
Support contains 120 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 134 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:54:04] [INFO ] Invariant cache hit.
[2023-03-14 20:54:04] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
[2023-03-14 20:54:04] [INFO ] Invariant cache hit.
[2023-03-14 20:54:04] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-14 20:54:04] [INFO ] Invariant cache hit.
[2023-03-14 20:54:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:54:07] [INFO ] Implicit Places using invariants and state equation in 2263 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
[2023-03-14 20:54:07] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-14 20:54:07] [INFO ] Invariant cache hit.
[2023-03-14 20:54:07] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3880 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s27 1) (GEQ s39 1) (GEQ s66 1)) (AND (GEQ s71 1) (GEQ s92 1) (GEQ s96 1)) (AND (GEQ s120 1) (GEQ s148 1) (GEQ s159 1)) (AND (GEQ s26 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-04 finished in 4167 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 U (p1||G(!p0))))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 110 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:54:08] [INFO ] Invariant cache hit.
[2023-03-14 20:54:08] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
[2023-03-14 20:54:08] [INFO ] Invariant cache hit.
[2023-03-14 20:54:08] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-14 20:54:08] [INFO ] Invariant cache hit.
[2023-03-14 20:54:09] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:54:11] [INFO ] Implicit Places using invariants and state equation in 2170 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
[2023-03-14 20:54:11] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-14 20:54:11] [INFO ] Invariant cache hit.
[2023-03-14 20:54:11] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3663 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s0 1) (GEQ s19 1) (GEQ s43 1) (GEQ s63 1) (GEQ s83 1) (GEQ s107 1) (GEQ s115 1) (GEQ s152 1) (GEQ s153 1) (GEQ s155 1))) (OR (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19185 reset in 4165 ms.
Product exploration explored 100000 steps with 19222 reset in 4103 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 (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 926 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 371 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-14 20:54:27] [INFO ] Invariant cache hit.
Could not prove EG (AND p0 (NOT p1))
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 114 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:54:42] [INFO ] Invariant cache hit.
[2023-03-14 20:54:43] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
[2023-03-14 20:54:43] [INFO ] Invariant cache hit.
[2023-03-14 20:54:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-14 20:54:43] [INFO ] Invariant cache hit.
[2023-03-14 20:54:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:54:45] [INFO ] Implicit Places using invariants and state equation in 2248 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
[2023-03-14 20:54:45] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-14 20:54:45] [INFO ] Invariant cache hit.
[2023-03-14 20:54:46] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3731 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 442 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 550 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-14 20:54:51] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 20:55:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p0 (NOT p1))
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 102 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 19351 reset in 1492 ms.
Product exploration explored 100000 steps with 19252 reset in 1527 ms.
Built C files in :
/tmp/ltsmin17123539501846635615
[2023-03-14 20:55:09] [INFO ] Too many transitions (1885) to apply POR reductions. Disabling POR matrices.
[2023-03-14 20:55:09] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17123539501846635615
Running compilation step : cd /tmp/ltsmin17123539501846635615;'/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/ltsmin17123539501846635615;'/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/ltsmin17123539501846635615;'/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)
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 117 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:55:12] [INFO ] Invariant cache hit.
[2023-03-14 20:55:13] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
[2023-03-14 20:55:13] [INFO ] Invariant cache hit.
[2023-03-14 20:55:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-14 20:55:13] [INFO ] Invariant cache hit.
[2023-03-14 20:55:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:55:15] [INFO ] Implicit Places using invariants and state equation in 2173 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
[2023-03-14 20:55:15] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-14 20:55:15] [INFO ] Invariant cache hit.
[2023-03-14 20:55:16] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3656 ms. Remains : 170/170 places, 1885/1885 transitions.
Built C files in :
/tmp/ltsmin6511663250625943749
[2023-03-14 20:55:16] [INFO ] Too many transitions (1885) to apply POR reductions. Disabling POR matrices.
[2023-03-14 20:55:16] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6511663250625943749
Running compilation step : cd /tmp/ltsmin6511663250625943749;'/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/ltsmin6511663250625943749;'/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/ltsmin6511663250625943749;'/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 20:55:19] [INFO ] Flatten gal took : 83 ms
[2023-03-14 20:55:19] [INFO ] Flatten gal took : 81 ms
[2023-03-14 20:55:21] [INFO ] Time to serialize gal into /tmp/LTL17335613710297754208.gal : 1804 ms
[2023-03-14 20:55:21] [INFO ] Time to serialize properties into /tmp/LTL9397605567245943157.prop : 14 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/LTL17335613710297754208.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2679923088419026219.hoa' '-atoms' '/tmp/LTL9397605567245943157.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...318
Loading property file /tmp/LTL9397605567245943157.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2679923088419026219.hoa
Detected timeout of ITS tools.
[2023-03-14 20:55:36] [INFO ] Flatten gal took : 87 ms
[2023-03-14 20:55:36] [INFO ] Flatten gal took : 84 ms
[2023-03-14 20:55:36] [INFO ] Time to serialize gal into /tmp/LTL16670652109060746161.gal : 14 ms
[2023-03-14 20:55:36] [INFO ] Time to serialize properties into /tmp/LTL10676416099729331918.ltl : 10 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/LTL16670652109060746161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10676416099729331918.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F((!("(((((Outside_10>=1)&&(Outside_4>=1))&&((Outside_3>=1)&&(Outside_5>=1)))&&(((Outside_6>=1)&&(Outside_7>=1))&&((Outside_8>=1)...84930
Formula 0 simplified : FG("(((((Outside_10>=1)&&(Outside_4>=1))&&((Outside_3>=1)&&(Outside_5>=1)))&&(((Outside_6>=1)&&(Outside_7>=1))&&((Outside_8>=1)&&(Ou...84730
Detected timeout of ITS tools.
[2023-03-14 20:55:52] [INFO ] Flatten gal took : 87 ms
[2023-03-14 20:55:52] [INFO ] Applying decomposition
[2023-03-14 20:55:52] [INFO ] Flatten gal took : 90 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/graph16160278791115992178.txt' '-o' '/tmp/graph16160278791115992178.bin' '-w' '/tmp/graph16160278791115992178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16160278791115992178.bin' '-l' '-1' '-v' '-w' '/tmp/graph16160278791115992178.weights' '-q' '0' '-e' '0.001'
[2023-03-14 20:55:52] [INFO ] Decomposing Gal with order
[2023-03-14 20:55:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 20:55:52] [INFO ] Removed a total of 2660 redundant transitions.
[2023-03-14 20:55:52] [INFO ] Flatten gal took : 436 ms
[2023-03-14 20:55:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-14 20:55:53] [INFO ] Time to serialize gal into /tmp/LTL900799453688369758.gal : 17 ms
[2023-03-14 20:55:53] [INFO ] Time to serialize properties into /tmp/LTL3840667241225459929.ltl : 8 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/LTL900799453688369758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3840667241225459929.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...253
Read 1 LTL properties
Checking formula 0 : !((G(F((!("(((((u7.Outside_10>=1)&&(u4.Outside_4>=1))&&((u2.Outside_3>=1)&&(u6.Outside_5>=1)))&&(((u5.Outside_6>=1)&&(u3.Outside_7>=1)...96990
Formula 0 simplified : FG("(((((u7.Outside_10>=1)&&(u4.Outside_4>=1))&&((u2.Outside_3>=1)&&(u6.Outside_5>=1)))&&(((u5.Outside_6>=1)&&(u3.Outside_7>=1))&&((...96760
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3349225828880526908
[2023-03-14 20:56:08] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3349225828880526908
Running compilation step : cd /tmp/ltsmin3349225828880526908;'/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/ltsmin3349225828880526908;'/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/ltsmin3349225828880526908;'/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)
Treatment of property PhilosophersDyn-PT-10-LTLFireability-06 finished in 123111 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(G(((p2 U p3)||p1))))))'
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 120 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:56:11] [INFO ] Invariant cache hit.
[2023-03-14 20:56:11] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
[2023-03-14 20:56:11] [INFO ] Invariant cache hit.
[2023-03-14 20:56:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-14 20:56:12] [INFO ] Invariant cache hit.
[2023-03-14 20:56:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:56:13] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2023-03-14 20:56:13] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-14 20:56:13] [INFO ] Invariant cache hit.
[2023-03-14 20:56:14] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2784 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(OR p1 p3 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={1} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=3 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=5 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={1} source=5 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (LT s4 1) (LT s21 1) (LT s22 1) (LT s86 1) (LT s41 1) (LT s72 1) (LT s136 1) (LT s11 1) (LT s58 1) (LT s46 1)) (AND (GEQ s27 1) (GEQ s39 1) (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-07 finished in 3242 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&&F(G(((p2||G(!p0))&&p1))))))'
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:56:14] [INFO ] Invariant cache hit.
[2023-03-14 20:56:14] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
[2023-03-14 20:56:15] [INFO ] Invariant cache hit.
[2023-03-14 20:56:15] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-14 20:56:15] [INFO ] Invariant cache hit.
[2023-03-14 20:56:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:56:22] [INFO ] Implicit Places using invariants and state equation in 7212 ms returned []
Implicit Place search using SMT with State Equation took 7558 ms to find 0 implicit places.
[2023-03-14 20:56:22] [INFO ] Invariant cache hit.
[2023-03-14 20:56:23] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8770 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 2090 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(OR (AND p2 p1) (AND p1 (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p2) p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 4}], [{ cond=(AND p2 p1 p0), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s41 1), p2:(GEQ s58 1), p1:(AND (GEQ s3 1) (GEQ s5 1) (GEQ s136 1) (GEQ s142 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-08 finished in 10886 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)||F(p1)))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 122 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:56:25] [INFO ] Invariant cache hit.
[2023-03-14 20:56:26] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
[2023-03-14 20:56:26] [INFO ] Invariant cache hit.
[2023-03-14 20:56:26] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-14 20:56:26] [INFO ] Invariant cache hit.
[2023-03-14 20:56:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:56:33] [INFO ] Implicit Places using invariants and state equation in 7271 ms returned []
Implicit Place search using SMT with State Equation took 7621 ms to find 0 implicit places.
[2023-03-14 20:56:33] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-14 20:56:33] [INFO ] Invariant cache hit.
[2023-03-14 20:56:34] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9072 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 577 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s35 1) (GEQ s81 1) (GEQ s118 1)), p0:(LT s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-09 finished in 9672 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(p0))||(!p1 U (p2||G(!p1)))))'
Support contains 15 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:56:34] [INFO ] Invariant cache hit.
[2023-03-14 20:56:35] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
[2023-03-14 20:56:35] [INFO ] Invariant cache hit.
[2023-03-14 20:56:35] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-14 20:56:35] [INFO ] Invariant cache hit.
[2023-03-14 20:56:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:56:42] [INFO ] Implicit Places using invariants and state equation in 6592 ms returned []
Implicit Place search using SMT with State Equation took 6883 ms to find 0 implicit places.
[2023-03-14 20:56:42] [INFO ] Invariant cache hit.
[2023-03-14 20:56:43] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8129 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (GEQ s26 1) (GEQ s44 1) (GEQ s99 1) (NOT (AND (GEQ s38 1) (GEQ s108 1)))), p1:(AND (GEQ s38 1) (GEQ s108 1)), p0:(AND (GEQ s0 1) (GEQ s19 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 2 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-10 finished in 8320 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(!p1)))&&F(!p1)) U X(p0)))'
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:56:43] [INFO ] Invariant cache hit.
[2023-03-14 20:56:43] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
[2023-03-14 20:56:43] [INFO ] Invariant cache hit.
[2023-03-14 20:56:44] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-14 20:56:44] [INFO ] Invariant cache hit.
[2023-03-14 20:56:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:56:51] [INFO ] Implicit Places using invariants and state equation in 7054 ms returned []
Implicit Place search using SMT with State Equation took 7399 ms to find 0 implicit places.
[2023-03-14 20:56:51] [INFO ] Invariant cache hit.
[2023-03-14 20:56:51] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8708 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 2255 ms :[p1, true, (NOT p0), (NOT p0), (NOT p0), (OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=p1, acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 1}, { cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=2, aps=[p1:(AND (GEQ s77 1) (GEQ s97 1)), p0:(AND (GEQ s12 1) (GEQ s57 1) (GEQ s68 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-11 finished in 10988 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(p0)))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:56:54] [INFO ] Invariant cache hit.
[2023-03-14 20:56:54] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
[2023-03-14 20:56:54] [INFO ] Invariant cache hit.
[2023-03-14 20:56:55] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-14 20:56:55] [INFO ] Invariant cache hit.
[2023-03-14 20:56:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:57:02] [INFO ] Implicit Places using invariants and state equation in 7263 ms returned []
Implicit Place search using SMT with State Equation took 7629 ms to find 0 implicit places.
[2023-03-14 20:57:02] [INFO ] Invariant cache hit.
[2023-03-14 20:57:03] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8813 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 1798 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s28 1) (GEQ s39 1) (GEQ s66 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-12 finished in 10641 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 8 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 118 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:57:05] [INFO ] Invariant cache hit.
[2023-03-14 20:57:05] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
[2023-03-14 20:57:05] [INFO ] Invariant cache hit.
[2023-03-14 20:57:05] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-14 20:57:05] [INFO ] Invariant cache hit.
[2023-03-14 20:57:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:57:12] [INFO ] Implicit Places using invariants and state equation in 6969 ms returned []
Implicit Place search using SMT with State Equation took 7290 ms to find 0 implicit places.
[2023-03-14 20:57:12] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-14 20:57:12] [INFO ] Invariant cache hit.
[2023-03-14 20:57:13] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8655 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-13 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 s13 1) (GEQ s18 1) (GEQ s63 1) (GEQ s108 1)), p1:(AND (GEQ s3 1) (GEQ s125 1) (GEQ s130 1) (GEQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-13 finished in 8943 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(X(p0)))&&(G(p1)||X(G(p2)))) U p0))'
Support contains 9 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:57:13] [INFO ] Invariant cache hit.
[2023-03-14 20:57:14] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
[2023-03-14 20:57:14] [INFO ] Invariant cache hit.
[2023-03-14 20:57:14] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-14 20:57:14] [INFO ] Invariant cache hit.
[2023-03-14 20:57:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:57:21] [INFO ] Implicit Places using invariants and state equation in 6958 ms returned []
Implicit Place search using SMT with State Equation took 7302 ms to find 0 implicit places.
[2023-03-14 20:57:21] [INFO ] Invariant cache hit.
[2023-03-14 20:57:22] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8494 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s46 1), p1:(AND (GEQ s26 1) (GEQ s99 1) (GEQ s128 1)), p2:(OR (GEQ s22 1) (AND (GEQ s31 1) (GEQ s80 1) (GEQ s108 1) (GEQ s153 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][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-15 finished in 8805 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)))'
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 U (p1||G(!p0))))))'
[2023-03-14 20:57:22] [INFO ] Flatten gal took : 93 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6338250803000687970
[2023-03-14 20:57:23] [INFO ] Too many transitions (1885) to apply POR reductions. Disabling POR matrices.
[2023-03-14 20:57:23] [INFO ] Applying decomposition
[2023-03-14 20:57:23] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6338250803000687970
Running compilation step : cd /tmp/ltsmin6338250803000687970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' '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'
[2023-03-14 20:57:23] [INFO ] Flatten gal took : 91 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/graph18012700979253722511.txt' '-o' '/tmp/graph18012700979253722511.bin' '-w' '/tmp/graph18012700979253722511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18012700979253722511.bin' '-l' '-1' '-v' '-w' '/tmp/graph18012700979253722511.weights' '-q' '0' '-e' '0.001'
[2023-03-14 20:57:23] [INFO ] Decomposing Gal with order
[2023-03-14 20:57:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 20:57:23] [INFO ] Removed a total of 2669 redundant transitions.
[2023-03-14 20:57:23] [INFO ] Flatten gal took : 317 ms
[2023-03-14 20:57:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-14 20:57:23] [INFO ] Time to serialize gal into /tmp/LTLFireability12973448977245060668.gal : 16 ms
[2023-03-14 20:57:23] [INFO ] Time to serialize properties into /tmp/LTLFireability8250001710622343549.ltl : 9 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/LTLFireability12973448977245060668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8250001710622343549.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...277
Read 2 LTL properties
Checking formula 0 : !((F(G(!("(((((u0.Outside_10>=1)&&(u3.Outside_4>=1))&&((u4.Outside_3>=1)&&(u5.Outside_5>=1)))&&(((u6.Outside_6>=1)&&(i7.u7.Outside_7>=...248
Formula 0 simplified : GF"(((((u0.Outside_10>=1)&&(u3.Outside_4>=1))&&((u4.Outside_3>=1)&&(u5.Outside_5>=1)))&&(((u6.Outside_6>=1)&&(i7.u7.Outside_7>=1))&&...238
Compilation finished in 4862 ms.
Running link step : cd /tmp/ltsmin6338250803000687970;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin6338250803000687970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t13, t15, t18, t22, t26, t28, t33, t41, t45, t46, t47, t48, t50, t54, t59, t60, t...5362
Computing Next relation with stutter on 14025 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
5802 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,58.2781,1227192,1,0,1.23086e+06,198294,22104,1.04011e+06,6143,901058,16131268
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-10-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F((!("(((((u0.Outside_10>=1)&&(u3.Outside_4>=1))&&((u4.Outside_3>=1)&&(u5.Outside_5>=1)))&&(((u6.Outside_6>=1)&&(i7.u7.Outside_7>...98598
Formula 1 simplified : FG("(((((u0.Outside_10>=1)&&(u3.Outside_4>=1))&&((u4.Outside_3>=1)&&(u5.Outside_5>=1)))&&(((u6.Outside_6>=1)&&(i7.u7.Outside_7>=1))&...98364
Computing Next relation with stutter on 14025 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
1083 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,69.1125,1355232,1,0,1.31166e+06,201941,31634,1.10828e+06,7204,932435,18138867
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-10-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 473893 ms.
BK_STOP 1678827611042
--------------------
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="PhilosophersDyn-PT-10"
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 PhilosophersDyn-PT-10, 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-167873945300324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 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 ;