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-167873945200315.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PhilosophersDyn-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945200315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 10K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 12:07 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 5.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 87K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678826664256

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-PT-03
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-14 20:44:25] [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 20:44:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 20:44:25] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-14 20:44:25] [INFO ] Transformed 30 places.
[2023-03-14 20:44:25] [INFO ] Transformed 84 transitions.
[2023-03-14 20:44:25] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 13 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-14 20:44:25] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-14 20:44:25] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-14 20:44:26] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2023-03-14 20:44:26] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 20:44:26] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-14 20:44:26] [INFO ] Invariant cache hit.
[2023-03-14 20:44:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:26] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-14 20:44:26] [INFO ] Flatten gal took : 35 ms
[2023-03-14 20:44:26] [INFO ] Flatten gal took : 11 ms
[2023-03-14 20:44:26] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 2272 ms. (steps per millisecond=4 ) properties (out of 28) seen :23
Incomplete Best-First random walk after 10001 steps, including 431 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 365 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 340 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 311 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 403 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-14 20:44:28] [INFO ] Invariant cache hit.
[2023-03-14 20:44:28] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 20:44:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-14 20:44:29] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-14 20:44:29] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:44:29] [INFO ] Invariant cache hit.
[2023-03-14 20:44:29] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
[2023-03-14 20:44:29] [INFO ] Invariant cache hit.
[2023-03-14 20:44:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-14 20:44:29] [INFO ] Invariant cache hit.
[2023-03-14 20:44:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:29] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-14 20:44:29] [INFO ] Invariant cache hit.
[2023-03-14 20:44:29] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 682 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 (ADD s5 s9 s21)), p1:(AND (LEQ 2 (ADD s3 s7 s10)) (LEQ 1 (ADD s2 s18 s26)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-00 finished in 980 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)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:44:30] [INFO ] Invariant cache hit.
[2023-03-14 20:44:30] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-14 20:44:30] [INFO ] Invariant cache hit.
[2023-03-14 20:44:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-14 20:44:30] [INFO ] Invariant cache hit.
[2023-03-14 20:44:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:30] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-14 20:44:30] [INFO ] Invariant cache hit.
[2023-03-14 20:44:30] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 1190 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s2 s18 s26))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-01 finished in 1382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||X((p2 U p3)))))))'
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:44:31] [INFO ] Invariant cache hit.
[2023-03-14 20:44:31] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2023-03-14 20:44:31] [INFO ] Invariant cache hit.
[2023-03-14 20:44:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 20:44:31] [INFO ] Invariant cache hit.
[2023-03-14 20:44:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:31] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-14 20:44:31] [INFO ] Invariant cache hit.
[2023-03-14 20:44:31] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s3 s7 s10)), p1:(LEQ 2 (ADD s4 s12 s14)), p3:(AND (LEQ (ADD s1 s20 s24) (ADD s3 s7 s10)) (LEQ 2 (ADD s4 s12 s14))), p2:(LEQ (ADD s1 s20 s24)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 23274 reset in 344 ms.
Product exploration explored 100000 steps with 23138 reset in 272 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 1341 ms. Reduced automaton from 2 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 1406 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 397 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 261 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 390 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 299 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 393 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-14 20:44:34] [INFO ] Invariant cache hit.
[2023-03-14 20:44:34] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-14 20:44:34] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-14 20:44:34] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:1
[2023-03-14 20:44:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-14 20:44:34] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-14 20:44:34] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (G (NOT (AND p1 p2 p0 (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p2) p0 (NOT p3))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND (NOT p1) p0 (NOT p3))))]
Knowledge based reduction with 21 factoid took 1244 ms. Reduced automaton from 2 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[false, false]
Stuttering acceptance computed with spot in 85 ms :[false, false]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:44:36] [INFO ] Invariant cache hit.
[2023-03-14 20:44:36] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2023-03-14 20:44:36] [INFO ] Invariant cache hit.
[2023-03-14 20:44:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-14 20:44:36] [INFO ] Invariant cache hit.
[2023-03-14 20:44:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:36] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-14 20:44:36] [INFO ] Invariant cache hit.
[2023-03-14 20:44:36] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 30/30 places, 51/51 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X p1), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2))))))]
Knowledge based reduction with 7 factoid took 580 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[false, false]
Finished random walk after 7 steps, including 1 resets, run visited all 5 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X p1), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2)))))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND (NOT p2) (NOT p3))), (F (NOT (OR p0 (AND (NOT p2) (NOT p3))))), (F p1), (F (AND (NOT p0) p3))]
Knowledge based reduction with 7 factoid took 1096 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[false, false]
Stuttering acceptance computed with spot in 95 ms :[false, false]
Stuttering acceptance computed with spot in 103 ms :[false, false]
Product exploration explored 100000 steps with 23231 reset in 260 ms.
Product exploration explored 100000 steps with 23294 reset in 221 ms.
Built C files in :
/tmp/ltsmin5726993580951851944
[2023-03-14 20:44:39] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5726993580951851944
Running compilation step : cd /tmp/ltsmin5726993580951851944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 239 ms.
Running link step : cd /tmp/ltsmin5726993580951851944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5726993580951851944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10305827472677406523.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-02 finished in 7713 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(G(p0)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:44:39] [INFO ] Invariant cache hit.
[2023-03-14 20:44:39] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-14 20:44:39] [INFO ] Invariant cache hit.
[2023-03-14 20:44:39] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-14 20:44:39] [INFO ] Invariant cache hit.
[2023-03-14 20:44:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:39] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-14 20:44:39] [INFO ] Invariant cache hit.
[2023-03-14 20:44:39] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-03 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT 3 (ADD s1 s20 s24))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 7 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-03 finished in 379 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((F(p0)&&(X(p0)||G(p1))))))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:44:39] [INFO ] Invariant cache hit.
[2023-03-14 20:44:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-14 20:44:39] [INFO ] Invariant cache hit.
[2023-03-14 20:44:39] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-14 20:44:39] [INFO ] Invariant cache hit.
[2023-03-14 20:44:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:39] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-14 20:44:39] [INFO ] Invariant cache hit.
[2023-03-14 20:44:39] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s2 s18 s26) (ADD s4 s12 s14)), p1:(AND (LEQ (ADD s1 s20 s24) (ADD s0 s6 s15 s16 s17 s19 s22 s25 s27)) (LEQ (ADD s8 s28 s29) (ADD s2 s18 s26))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 162 ms.
Product exploration explored 100000 steps with 33333 reset in 154 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 155 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-PT-03-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-05 finished in 801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G(!p0)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:44:40] [INFO ] Invariant cache hit.
[2023-03-14 20:44:40] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2023-03-14 20:44:40] [INFO ] Invariant cache hit.
[2023-03-14 20:44:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 20:44:40] [INFO ] Invariant cache hit.
[2023-03-14 20:44:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:40] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-14 20:44:40] [INFO ] Invariant cache hit.
[2023-03-14 20:44:40] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), p0, false, (NOT p0), false, false]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-07 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}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 2}]], initial=3, aps=[p0:(GT (ADD s5 s9 s21) (ADD s1 s20 s24))], 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 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-07 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 14 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:44:41] [INFO ] Invariant cache hit.
[2023-03-14 20:44:41] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-14 20:44:41] [INFO ] Invariant cache hit.
[2023-03-14 20:44:41] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 20:44:41] [INFO ] Invariant cache hit.
[2023-03-14 20:44:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:41] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-14 20:44:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 20:44:41] [INFO ] Invariant cache hit.
[2023-03-14 20:44:41] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s18 s16), p1:(GT s9 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-08 finished in 316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:44:41] [INFO ] Invariant cache hit.
[2023-03-14 20:44:41] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-14 20:44:41] [INFO ] Invariant cache hit.
[2023-03-14 20:44:41] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 20:44:41] [INFO ] Invariant cache hit.
[2023-03-14 20:44:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:41] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-14 20:44:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 20:44:41] [INFO ] Invariant cache hit.
[2023-03-14 20:44:41] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s11 s29) (LEQ s12 s28)), p1:(LEQ s11 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 40 steps with 6 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-09 finished in 627 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(F(p1))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:44:41] [INFO ] Invariant cache hit.
[2023-03-14 20:44:42] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-14 20:44:42] [INFO ] Invariant cache hit.
[2023-03-14 20:44:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-14 20:44:42] [INFO ] Invariant cache hit.
[2023-03-14 20:44:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:42] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-14 20:44:42] [INFO ] Invariant cache hit.
[2023-03-14 20:44:42] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 3158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s7 s23), p0:(GT s22 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-11 finished in 3350 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)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:44:45] [INFO ] Invariant cache hit.
[2023-03-14 20:44:45] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-14 20:44:45] [INFO ] Invariant cache hit.
[2023-03-14 20:44:45] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-14 20:44:45] [INFO ] Invariant cache hit.
[2023-03-14 20:44:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:44:45] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-14 20:44:45] [INFO ] Invariant cache hit.
[2023-03-14 20:44:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s13 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-15 finished in 308 ms.
All properties solved by simple procedures.
Total runtime 19940 ms.

BK_STOP 1678826697200

--------------------
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-PT-03"
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-PT-03, 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-167873945200315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 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 ;