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-167873945200291.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-COL-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945200291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:03 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 4.1K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 26 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 32K 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-COL-20-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678819873004

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-20
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-14 18:51:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 18:51:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 18:51:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 18:51:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 18:51:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 635 ms
[2023-03-14 18:51:15] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 540 PT places and 17240.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 18:51:15] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 4 ms.
[2023-03-14 18:51:15] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 430 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 27) seen :23
Incomplete Best-First random walk after 10000 steps, including 501 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 512 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 625 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 8 cols
[2023-03-14 18:51:15] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-14 18:51:15] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-14 18:51:15] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 18:51:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 18:51:15] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-14 18:51:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 18:51:15] [INFO ] After 6ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-14 18:51:15] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-14 18:51:15] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 7 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-14 18:51:15] [INFO ] Invariant cache hit.
[2023-03-14 18:51:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 8/8 places, 7/7 transitions.
Incomplete random walk after 10003 steps, including 441 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Probably explored full state space saw : 2014 states, properties seen :0
Probabilistic random walk after 6629 steps, saw 2014 distinct states, run finished after 29 ms. (steps per millisecond=228 ) properties seen :0
Explored full state space saw : 2014 states, properties seen :0
Exhaustive walk after 6629 steps, saw 2014 distinct states, run finished after 20 ms. (steps per millisecond=331 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
[2023-03-14 18:51:16] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-14 18:51:16] [INFO ] Flatten gal took : 18 ms
FORMULA PhilosophersDyn-COL-20-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 18:51:16] [INFO ] Flatten gal took : 2 ms
Domain [Philosopher(20), Philosopher(20)] of place Neighbourhood breaks symmetries in sort Philosopher
[2023-03-14 18:51:16] [INFO ] Unfolded HLPN to a Petri net with 540 places and 17220 transitions 140780 arcs in 179 ms.
[2023-03-14 18:51:16] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
Support contains 540 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 112 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
[2023-03-14 18:51:16] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2023-03-14 18:51:17] [INFO ] Computed 79 place invariants in 823 ms
[2023-03-14 18:51:22] [INFO ] Dead Transitions using invariants and state equation in 6437 ms found 1560 transitions.
Found 1560 dead transitions using SMT.
Drop transitions removed 1560 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1560 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2023-03-14 18:51:24] [INFO ] Computed 79 place invariants in 1780 ms
[2023-03-14 18:51:24] [INFO ] Implicit Places using invariants in 1899 ms returned []
Implicit Place search using SMT only with invariants took 1900 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 540/540 places, 15470/17030 transitions.
Applied a total of 0 rules in 96 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8557 ms. Remains : 540/540 places, 15470/17030 transitions.
Support contains 540 out of 540 places after structural reductions.
[2023-03-14 18:51:25] [INFO ] Flatten gal took : 847 ms
[2023-03-14 18:51:26] [INFO ] Flatten gal took : 630 ms
[2023-03-14 18:51:28] [INFO ] Input system was already deterministic with 15470 transitions.
Incomplete random walk after 10000 steps, including 1144 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 26) seen :19
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-14 18:51:29] [INFO ] Invariant cache hit.
[2023-03-14 18:51:29] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-14 18:51:29] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 43 ms returned sat
[2023-03-14 18:51:36] [INFO ] After 6843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 18:51:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 18:51:36] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 42 ms returned sat
[2023-03-14 18:51:47] [INFO ] After 11381ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-14 18:51:48] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-14 18:52:01] [INFO ] After 13148ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-14 18:52:01] [INFO ] After 13151ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-14 18:52:01] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 158 ms.
Support contains 80 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2146 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:52:03] [INFO ] Invariant cache hit.
[2023-03-14 18:52:08] [INFO ] Dead Transitions using invariants and state equation in 4830 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6986 ms. Remains : 540/540 places, 15470/15470 transitions.
Incomplete random walk after 10000 steps, including 1143 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 36385 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36385 steps, saw 10122 distinct states, run finished after 3003 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-14 18:52:11] [INFO ] Invariant cache hit.
[2023-03-14 18:52:12] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 18:52:12] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 45 ms returned sat
[2023-03-14 18:52:26] [INFO ] After 14645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 18:52:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-14 18:52:26] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 45 ms returned sat
[2023-03-14 18:52:36] [INFO ] After 9386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 18:52:36] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-14 18:52:51] [INFO ] After 15313ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 18:52:51] [INFO ] After 15314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-14 18:52:51] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 80 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2055 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2055 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2119 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:52:56] [INFO ] Invariant cache hit.
[2023-03-14 18:52:57] [INFO ] Implicit Places using invariants in 1613 ms returned []
Implicit Place search using SMT only with invariants took 1615 ms to find 0 implicit places.
[2023-03-14 18:52:57] [INFO ] Invariant cache hit.
[2023-03-14 18:53:02] [INFO ] Dead Transitions using invariants and state equation in 4922 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8662 ms. Remains : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 808 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-14 18:53:03] [INFO ] Invariant cache hit.
[2023-03-14 18:53:03] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-14 18:53:03] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 45 ms returned sat
[2023-03-14 18:53:17] [INFO ] After 14087ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 18:53:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 18:53:17] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 44 ms returned sat
[2023-03-14 18:53:24] [INFO ] After 6259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 18:53:27] [INFO ] After 9300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2500 ms.
[2023-03-14 18:53:29] [INFO ] After 12007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
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(G((G(p1)||p0))) U (p1&&(p2 U X(p3)))))'
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 47 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:53:30] [INFO ] Invariant cache hit.
[2023-03-14 18:53:35] [INFO ] Dead Transitions using invariants and state equation in 4976 ms found 0 transitions.
[2023-03-14 18:53:35] [INFO ] Invariant cache hit.
[2023-03-14 18:53:35] [INFO ] Implicit Places using invariants in 734 ms returned []
Implicit Place search using SMT only with invariants took 735 ms to find 0 implicit places.
[2023-03-14 18:53:35] [INFO ] Invariant cache hit.
[2023-03-14 18:53:40] [INFO ] Dead Transitions using invariants and state equation in 4846 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10609 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 540 ms :[(OR (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p3), true, (NOT p1), (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p1) p0 (NOT p3)), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 8}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 9}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=6 dest: 4}], [{ cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p1 p2 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(LEQ 3 (ADD s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 4 reset in 14 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-02 finished in 11249 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 U p1))))'
Support contains 420 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 47 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:53:41] [INFO ] Invariant cache hit.
[2023-03-14 18:53:46] [INFO ] Dead Transitions using invariants and state equation in 4813 ms found 0 transitions.
[2023-03-14 18:53:46] [INFO ] Invariant cache hit.
[2023-03-14 18:53:47] [INFO ] Implicit Places using invariants in 1359 ms returned []
Implicit Place search using SMT only with invariants took 1360 ms to find 0 implicit places.
[2023-03-14 18:53:47] [INFO ] Invariant cache hit.
[2023-03-14 18:53:52] [INFO ] Dead Transitions using invariants and state equation in 4847 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11071 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 465 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 (ADD s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 56 steps with 6 reset in 9 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-03 finished in 11575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(G(p1)||G(p2))))))'
Support contains 60 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 79 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:53:52] [INFO ] Invariant cache hit.
[2023-03-14 18:53:57] [INFO ] Dead Transitions using invariants and state equation in 4859 ms found 0 transitions.
[2023-03-14 18:53:57] [INFO ] Invariant cache hit.
[2023-03-14 18:53:59] [INFO ] Implicit Places using invariants in 2141 ms returned []
Implicit Place search using SMT only with invariants took 2142 ms to find 0 implicit places.
[2023-03-14 18:53:59] [INFO ] Invariant cache hit.
[2023-03-14 18:54:04] [INFO ] Dead Transitions using invariants and state equation in 4824 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11907 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139)), p1:(LEQ 1 (ADD s40 s41 s42 s43 s44 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 398 steps with 44 reset in 26 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-05 finished in 12169 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)||X(X(F(p1)))))'
Support contains 60 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 80 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:54:05] [INFO ] Invariant cache hit.
[2023-03-14 18:54:09] [INFO ] Dead Transitions using invariants and state equation in 4774 ms found 0 transitions.
[2023-03-14 18:54:09] [INFO ] Invariant cache hit.
[2023-03-14 18:54:11] [INFO ] Implicit Places using invariants in 2153 ms returned []
Implicit Place search using SMT only with invariants took 2154 ms to find 0 implicit places.
[2023-03-14 18:54:11] [INFO ] Invariant cache hit.
[2023-03-14 18:54:16] [INFO ] Dead Transitions using invariants and state equation in 4836 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11847 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 3 (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99)), p0:(LEQ (ADD s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70...], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-06 finished in 12082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X(G(p2)))))'
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 49 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:54:17] [INFO ] Invariant cache hit.
[2023-03-14 18:54:21] [INFO ] Dead Transitions using invariants and state equation in 4801 ms found 0 transitions.
[2023-03-14 18:54:21] [INFO ] Invariant cache hit.
[2023-03-14 18:54:22] [INFO ] Implicit Places using invariants in 734 ms returned []
Implicit Place search using SMT only with invariants took 736 ms to find 0 implicit places.
[2023-03-14 18:54:22] [INFO ] Invariant cache hit.
[2023-03-14 18:54:27] [INFO ] Dead Transitions using invariants and state equation in 4872 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10463 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GT 1 (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139)), p1:(LEQ (ADD s60 s61 s62 s63 s64 s65 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 268 steps with 29 reset in 33 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-07 finished in 10752 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))'
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2802 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:54:30] [INFO ] Invariant cache hit.
[2023-03-14 18:54:35] [INFO ] Dead Transitions using invariants and state equation in 4836 ms found 0 transitions.
[2023-03-14 18:54:35] [INFO ] Invariant cache hit.
[2023-03-14 18:54:37] [INFO ] Implicit Places using invariants in 2152 ms returned []
Implicit Place search using SMT only with invariants took 2158 ms to find 0 implicit places.
[2023-03-14 18:54:37] [INFO ] Invariant cache hit.
[2023-03-14 18:54:42] [INFO ] Dead Transitions using invariants and state equation in 4821 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14620 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11454 reset in 2942 ms.
Product exploration explored 100000 steps with 11465 reset in 2858 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 p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1136 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40859 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40859 steps, saw 11339 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 18:54:51] [INFO ] Invariant cache hit.
[2023-03-14 18:54:52] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-14 18:54:52] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 43 ms returned sat
[2023-03-14 18:54:55] [INFO ] After 3750ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 18:54:56] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-14 18:55:06] [INFO ] After 10444ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-14 18:55:06] [INFO ] After 14548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1828 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:55:08] [INFO ] Invariant cache hit.
[2023-03-14 18:55:13] [INFO ] Dead Transitions using invariants and state equation in 4773 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6602 ms. Remains : 540/540 places, 15470/15470 transitions.
Incomplete random walk after 10000 steps, including 1149 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40774 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40774 steps, saw 11321 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 18:55:16] [INFO ] Invariant cache hit.
[2023-03-14 18:55:16] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-14 18:55:16] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 44 ms returned sat
[2023-03-14 18:55:20] [INFO ] After 3861ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 18:55:20] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-14 18:55:31] [INFO ] After 10442ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-14 18:55:31] [INFO ] After 14589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1822 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1822 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1826 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:55:34] [INFO ] Invariant cache hit.
[2023-03-14 18:55:36] [INFO ] Implicit Places using invariants in 2178 ms returned []
Implicit Place search using SMT only with invariants took 2179 ms to find 0 implicit places.
[2023-03-14 18:55:36] [INFO ] Invariant cache hit.
[2023-03-14 18:55:41] [INFO ] Dead Transitions using invariants and state equation in 4848 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8856 ms. Remains : 540/540 places, 15470/15470 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 540 transition count 22670
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 520 transition count 22670
Applied a total of 40 rules in 953 ms. Remains 520 /540 variables (removed 20) and now considering 22670/15470 (removed -7200) transitions.
Running SMT prover for 1 properties.
[2023-03-14 18:55:42] [INFO ] Flow matrix only has 22290 transitions (discarded 380 similar events)
// Phase 1: matrix 22290 rows 520 cols
[2023-03-14 18:55:44] [INFO ] Computed 79 place invariants in 1258 ms
[2023-03-14 18:55:44] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2023-03-14 18:55:44] [INFO ] [Real]Absence check using 26 positive and 53 generalized place invariants in 42 ms returned sat
[2023-03-14 18:55:51] [INFO ] After 7147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 18:55:51] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-14 18:56:01] [INFO ] After 9950ms SMT Verify possible using 400 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-14 18:56:01] [INFO ] After 17325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2489 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2023-03-14 18:56:05] [INFO ] Computed 79 place invariants in 1717 ms
[2023-03-14 18:56:10] [INFO ] Dead Transitions using invariants and state equation in 6562 ms found 0 transitions.
[2023-03-14 18:56:10] [INFO ] Invariant cache hit.
[2023-03-14 18:56:12] [INFO ] Implicit Places using invariants in 2263 ms returned []
Implicit Place search using SMT only with invariants took 2264 ms to find 0 implicit places.
[2023-03-14 18:56:12] [INFO ] Invariant cache hit.
[2023-03-14 18:56:17] [INFO ] Dead Transitions using invariants and state equation in 4823 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16141 ms. Remains : 540/540 places, 15470/15470 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 p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1145 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40222 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40222 steps, saw 11168 distinct states, run finished after 3003 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 18:56:21] [INFO ] Invariant cache hit.
[2023-03-14 18:56:21] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 18:56:21] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 44 ms returned sat
[2023-03-14 18:56:25] [INFO ] After 3735ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 18:56:25] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-14 18:56:35] [INFO ] After 10427ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-14 18:56:35] [INFO ] After 14441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 12 ms.
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1997 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:56:37] [INFO ] Invariant cache hit.
[2023-03-14 18:56:42] [INFO ] Dead Transitions using invariants and state equation in 4844 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6842 ms. Remains : 540/540 places, 15470/15470 transitions.
Incomplete random walk after 10000 steps, including 1144 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39517 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39517 steps, saw 10979 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 18:56:46] [INFO ] Invariant cache hit.
[2023-03-14 18:56:46] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-14 18:56:46] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 44 ms returned sat
[2023-03-14 18:56:50] [INFO ] After 3890ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 18:56:50] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-14 18:57:00] [INFO ] After 10456ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-14 18:57:00] [INFO ] After 14627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 ms.
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1856 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1857 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1805 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 18:57:04] [INFO ] Invariant cache hit.
[2023-03-14 18:57:06] [INFO ] Implicit Places using invariants in 2171 ms returned []
Implicit Place search using SMT only with invariants took 2172 ms to find 0 implicit places.
[2023-03-14 18:57:06] [INFO ] Invariant cache hit.
[2023-03-14 18:57:11] [INFO ] Dead Transitions using invariants and state equation in 4833 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8813 ms. Remains : 540/540 places, 15470/15470 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 540 transition count 22670
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 520 transition count 22670
Applied a total of 40 rules in 841 ms. Remains 520 /540 variables (removed 20) and now considering 22670/15470 (removed -7200) transitions.
Running SMT prover for 1 properties.
[2023-03-14 18:57:12] [INFO ] Flow matrix only has 22290 transitions (discarded 380 similar events)
// Phase 1: matrix 22290 rows 520 cols
[2023-03-14 18:57:13] [INFO ] Computed 79 place invariants in 1245 ms
[2023-03-14 18:57:13] [INFO ] [Real]Absence check using 26 positive place invariants in 15 ms returned sat
[2023-03-14 18:57:13] [INFO ] [Real]Absence check using 26 positive and 53 generalized place invariants in 40 ms returned sat
[2023-03-14 18:57:20] [INFO ] After 6930ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 18:57:20] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-14 18:57:30] [INFO ] After 9967ms SMT Verify possible using 400 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-14 18:57:30] [INFO ] After 17078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 11447 reset in 2809 ms.
Product exploration explored 100000 steps with 11447 reset in 2839 ms.
Built C files in :
/tmp/ltsmin11437662930193495865
[2023-03-14 18:57:36] [INFO ] Too many transitions (15470) to apply POR reductions. Disabling POR matrices.
[2023-03-14 18:57:36] [INFO ] Built C files in 196ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11437662930193495865
Running compilation step : cd /tmp/ltsmin11437662930193495865;'/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/ltsmin11437662930193495865;'/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/ltsmin11437662930193495865;'/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 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2457 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2023-03-14 18:57:43] [INFO ] Computed 79 place invariants in 1668 ms
[2023-03-14 18:57:48] [INFO ] Dead Transitions using invariants and state equation in 6425 ms found 0 transitions.
[2023-03-14 18:57:48] [INFO ] Invariant cache hit.
[2023-03-14 18:57:50] [INFO ] Implicit Places using invariants in 2229 ms returned []
Implicit Place search using SMT only with invariants took 2230 ms to find 0 implicit places.
[2023-03-14 18:57:50] [INFO ] Invariant cache hit.
[2023-03-14 18:57:55] [INFO ] Dead Transitions using invariants and state equation in 4770 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15884 ms. Remains : 540/540 places, 15470/15470 transitions.
Built C files in :
/tmp/ltsmin12793900027373172573
[2023-03-14 18:57:55] [INFO ] Too many transitions (15470) to apply POR reductions. Disabling POR matrices.
[2023-03-14 18:57:55] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12793900027373172573
Running compilation step : cd /tmp/ltsmin12793900027373172573;'/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/ltsmin12793900027373172573;'/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/ltsmin12793900027373172573;'/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 18:58:00] [INFO ] Flatten gal took : 565 ms
[2023-03-14 18:58:00] [INFO ] Flatten gal took : 572 ms
[2023-03-14 18:58:00] [INFO ] Time to serialize gal into /tmp/LTL2827197816094912748.gal : 128 ms
[2023-03-14 18:58:00] [INFO ] Time to serialize properties into /tmp/LTL4418692348053097469.prop : 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/LTL2827197816094912748.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1153545175108156085.hoa' '-atoms' '/tmp/LTL4418692348053097469.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...317
Loading property file /tmp/LTL4418692348053097469.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1153545175108156085.hoa
Detected timeout of ITS tools.
[2023-03-14 18:58:16] [INFO ] Flatten gal took : 611 ms
[2023-03-14 18:58:17] [INFO ] Flatten gal took : 534 ms
[2023-03-14 18:58:17] [INFO ] Time to serialize gal into /tmp/LTL8261445444953079481.gal : 119 ms
[2023-03-14 18:58:17] [INFO ] Time to serialize properties into /tmp/LTL3365580449477405417.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8261445444953079481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3365580449477405417.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...275
Read 1 LTL properties
Checking formula 0 : !((G("((((((Outside_0+Outside_1)+(Outside_2+Outside_3))+((Outside_4+Outside_5)+(Outside_6+Outside_7)))+(((Outside_8+Outside_9)+(Outsid...528
Formula 0 simplified : F!"((((((Outside_0+Outside_1)+(Outside_2+Outside_3))+((Outside_4+Outside_5)+(Outside_6+Outside_7)))+(((Outside_8+Outside_9)+(Outside...524
Detected timeout of ITS tools.
[2023-03-14 18:58:33] [INFO ] Flatten gal took : 547 ms
[2023-03-14 18:58:33] [INFO ] Applying decomposition
[2023-03-14 18:58:33] [INFO ] Flatten gal took : 553 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/graph9412126047872511488.txt' '-o' '/tmp/graph9412126047872511488.bin' '-w' '/tmp/graph9412126047872511488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9412126047872511488.bin' '-l' '-1' '-v' '-w' '/tmp/graph9412126047872511488.weights' '-q' '0' '-e' '0.001'
[2023-03-14 18:58:35] [INFO ] Decomposing Gal with order
[2023-03-14 18:58:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 18:59:25] [INFO ] Removed a total of 16869 redundant transitions.
[2023-03-14 18:59:29] [INFO ] Flatten gal took : 53870 ms
[2023-03-14 18:59:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 28444 labels/synchronizations in 6219 ms.
[2023-03-14 18:59:44] [INFO ] Time to serialize gal into /tmp/LTL7269140766067048117.gal : 115 ms
[2023-03-14 18:59:44] [INFO ] Time to serialize properties into /tmp/LTL11069723939649419593.ltl : 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/LTL7269140766067048117.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11069723939649419593.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 : !((G("((((((gu10.Outside_0+gu10.Outside_1)+(gu10.Outside_2+gu10.Outside_3))+((gu10.Outside_4+gu10.Outside_5)+(gu10.Outside_6+gu10.Outs...728
Formula 0 simplified : F!"((((((gu10.Outside_0+gu10.Outside_1)+(gu10.Outside_2+gu10.Outside_3))+((gu10.Outside_4+gu10.Outside_5)+(gu10.Outside_6+gu10.Outsi...724
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11636989656203166306
[2023-03-14 19:00:00] [INFO ] Built C files in 137ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11636989656203166306
Running compilation step : cd /tmp/ltsmin11636989656203166306;'/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/ltsmin11636989656203166306;'/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/ltsmin11636989656203166306;'/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-COL-20-LTLCardinality-08 finished in 335384 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' '!(((p0||G(F(p1))) U (p2&&F(G(p3)))))'
Support contains 140 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2557 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 19:00:05] [INFO ] Invariant cache hit.
[2023-03-14 19:00:10] [INFO ] Dead Transitions using invariants and state equation in 4897 ms found 0 transitions.
[2023-03-14 19:00:10] [INFO ] Invariant cache hit.
[2023-03-14 19:00:12] [INFO ] Implicit Places using invariants in 1528 ms returned []
Implicit Place search using SMT only with invariants took 1530 ms to find 0 implicit places.
[2023-03-14 19:00:12] [INFO ] Invariant cache hit.
[2023-03-14 19:00:16] [INFO ] Dead Transitions using invariants and state equation in 4828 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13818 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (NOT p3)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LEQ 1 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119)) (LEQ (ADD s120 s121 s122 s123 s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 11441 reset in 2984 ms.
Stack based approach found an accepted trace after 25031 steps with 2864 reset with depth 6 and stack size 6 in 755 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-09 finished in 17822 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)))'
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1907 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 19:00:22] [INFO ] Invariant cache hit.
[2023-03-14 19:00:27] [INFO ] Dead Transitions using invariants and state equation in 4862 ms found 0 transitions.
[2023-03-14 19:00:27] [INFO ] Invariant cache hit.
[2023-03-14 19:00:30] [INFO ] Implicit Places using invariants in 2905 ms returned []
Implicit Place search using SMT only with invariants took 2906 ms to find 0 implicit places.
[2023-03-14 19:00:30] [INFO ] Invariant cache hit.
[2023-03-14 19:00:35] [INFO ] Dead Transitions using invariants and state equation in 4904 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14580 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 1 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-10 finished in 14680 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(X((!p0&&G(p1)))))))'
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 89 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 19:00:35] [INFO ] Invariant cache hit.
[2023-03-14 19:00:40] [INFO ] Dead Transitions using invariants and state equation in 4835 ms found 0 transitions.
[2023-03-14 19:00:40] [INFO ] Invariant cache hit.
[2023-03-14 19:00:43] [INFO ] Implicit Places using invariants in 2778 ms returned []
Implicit Place search using SMT only with invariants took 2778 ms to find 0 implicit places.
[2023-03-14 19:00:43] [INFO ] Invariant cache hit.
[2023-03-14 19:00:48] [INFO ] Dead Transitions using invariants and state equation in 4751 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12458 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19)), p0:(LEQ 1 (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-12 finished in 12743 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) U p1))'
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 87 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 19:00:48] [INFO ] Invariant cache hit.
[2023-03-14 19:00:53] [INFO ] Dead Transitions using invariants and state equation in 4779 ms found 0 transitions.
[2023-03-14 19:00:53] [INFO ] Invariant cache hit.
[2023-03-14 19:00:55] [INFO ] Implicit Places using invariants in 2337 ms returned []
Implicit Place search using SMT only with invariants took 2338 ms to find 0 implicit places.
[2023-03-14 19:00:55] [INFO ] Invariant cache hit.
[2023-03-14 19:01:00] [INFO ] Dead Transitions using invariants and state equation in 4811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12016 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 (ADD s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79)), p0:(GT 1 (ADD s120 s121 s122 s123 s124 s125 s126 s127 s1...], 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 104 steps with 15 reset in 5 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-13 finished in 12157 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) U p1) U p2))'
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2522 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 19:01:03] [INFO ] Invariant cache hit.
[2023-03-14 19:01:07] [INFO ] Dead Transitions using invariants and state equation in 4811 ms found 0 transitions.
[2023-03-14 19:01:07] [INFO ] Invariant cache hit.
[2023-03-14 19:01:08] [INFO ] Implicit Places using invariants in 741 ms returned []
Implicit Place search using SMT only with invariants took 742 ms to find 0 implicit places.
[2023-03-14 19:01:08] [INFO ] Invariant cache hit.
[2023-03-14 19:01:13] [INFO ] Dead Transitions using invariants and state equation in 4894 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12970 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GT (ADD s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 90780 steps with 45390 reset in 10001 ms.
Product exploration timeout after 92050 steps with 46025 reset in 10002 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 p2) p1 p0), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 634 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1142 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 19:01:35] [INFO ] Invariant cache hit.
[2023-03-14 19:01:35] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))
Knowledge based reduction with 16 factoid took 538 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-20-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-14 finished in 35670 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(p0))'
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1901 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 19:01:38] [INFO ] Invariant cache hit.
[2023-03-14 19:01:42] [INFO ] Dead Transitions using invariants and state equation in 4788 ms found 0 transitions.
[2023-03-14 19:01:42] [INFO ] Invariant cache hit.
[2023-03-14 19:01:45] [INFO ] Implicit Places using invariants in 2815 ms returned []
Implicit Place search using SMT only with invariants took 2816 ms to find 0 implicit places.
[2023-03-14 19:01:45] [INFO ] Invariant cache hit.
[2023-03-14 19:01:50] [INFO ] Dead Transitions using invariants and state equation in 4875 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14382 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 1 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-15 finished in 14444 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))'
[2023-03-14 19:01:51] [INFO ] Flatten gal took : 766 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15316793288670805720
[2023-03-14 19:01:52] [INFO ] Too many transitions (15470) to apply POR reductions. Disabling POR matrices.
[2023-03-14 19:01:52] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15316793288670805720
Running compilation step : cd /tmp/ltsmin15316793288670805720;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-14 19:01:52] [INFO ] Applying decomposition
[2023-03-14 19:01:52] [INFO ] Flatten gal took : 583 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/graph11058004659300809220.txt' '-o' '/tmp/graph11058004659300809220.bin' '-w' '/tmp/graph11058004659300809220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11058004659300809220.bin' '-l' '-1' '-v' '-w' '/tmp/graph11058004659300809220.weights' '-q' '0' '-e' '0.001'
[2023-03-14 19:01:54] [INFO ] Decomposing Gal with order
[2023-03-14 19:01:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 19:02:54] [INFO ] Removed a total of 15989 redundant transitions.
[2023-03-14 19:02:58] [INFO ] Flatten gal took : 63253 ms
[2023-03-14 19:03:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 29120 labels/synchronizations in 6042 ms.
[2023-03-14 19:03:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality736692484614075976.gal : 87 ms
[2023-03-14 19:03:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality15275459420707404532.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/LTLCardinality736692484614075976.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15275459420707404532.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G("((((((gu8.Outside_0+gu8.Outside_1)+(gu8.Outside_2+gu8.Outside_3))+((gu8.Outside_4+gu8.Outside_5)+(gu8.Outside_6+gu8.Outside_7)))...688
Formula 0 simplified : F!"((((((gu8.Outside_0+gu8.Outside_1)+(gu8.Outside_2+gu8.Outside_3))+((gu8.Outside_4+gu8.Outside_5)+(gu8.Outside_6+gu8.Outside_7)))+...684
Compilation finished in 129333 ms.
Running link step : cd /tmp/ltsmin15316793288670805720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 139 ms.
Running LTSmin : cd /tmp/ltsmin15316793288670805720;'/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'
Detected timeout of ITS tools.
[2023-03-14 19:26:49] [INFO ] Applying decomposition
[2023-03-14 19:26:58] [INFO ] Flatten gal took : 9440 ms
[2023-03-14 19:27:00] [INFO ] Decomposing Gal with order
[2023-03-14 19:27:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 19:27:05] [INFO ] Removed a total of 76920 redundant transitions.
[2023-03-14 19:27:05] [INFO ] Flatten gal took : 2783 ms
[2023-03-14 19:27:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 665 ms.
[2023-03-14 19:27:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality5219839410311200585.gal : 139 ms
[2023-03-14 19:27:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality4879270336152923895.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/LTLCardinality5219839410311200585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4879270336152923895.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G("((((((gPhilosopher0.Outside_0+gPhilosopher1.Outside_1)+(gPhilosopher2.Outside_2+gPhilosopher3.Outside_3))+((gPhilosopher4.Outsid...1108
Formula 0 simplified : F!"((((((gPhilosopher0.Outside_0+gPhilosopher1.Outside_1)+(gPhilosopher2.Outside_2+gPhilosopher3.Outside_3))+((gPhilosopher4.Outside...1104
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 140960 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15046488 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -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-COL-20"
export BK_EXAMINATION="LTLCardinality"
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-COL-20, examination is LTLCardinality"
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-167873945200291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-20.tgz
mv PhilosophersDyn-COL-20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;