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.r297-tall-167873950200251.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 ltsminxred
Input is Philosophers-PT-002000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950200251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 77M
-rw-r--r-- 1 mcc users 2.1M Feb 25 16:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 11M Feb 25 16:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Feb 25 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.8M Feb 25 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.1M Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.7M Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 702K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.1M Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4M Feb 25 20:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17M Feb 25 20:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8M Feb 25 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17M Feb 25 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 527K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.5M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679472383642

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-002000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 08:06:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 08:06:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 08:06:26] [INFO ] Load time of PNML (sax parser for PT used): 814 ms
[2023-03-22 08:06:26] [INFO ] Transformed 10000 places.
[2023-03-22 08:06:26] [INFO ] Transformed 10000 transitions.
[2023-03-22 08:06:26] [INFO ] Parsed PT model containing 10000 places and 10000 transitions and 32000 arcs in 1090 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 1846 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-PT-002000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-002000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-002000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 110 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-22 08:06:29] [INFO ] Computed 4000 place invariants in 126 ms
[2023-03-22 08:06:31] [INFO ] Implicit Places using invariants in 1935 ms returned []
Implicit Place search using SMT only with invariants took 1988 ms to find 0 implicit places.
[2023-03-22 08:06:31] [INFO ] Invariant cache hit.
[2023-03-22 08:06:32] [INFO ] Dead Transitions using invariants and state equation in 1443 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3554 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Support contains 10000 out of 10000 places after structural reductions.
[2023-03-22 08:06:34] [INFO ] Flatten gal took : 1003 ms
[2023-03-22 08:06:35] [INFO ] Flatten gal took : 628 ms
[2023-03-22 08:06:36] [INFO ] Input system was already deterministic with 10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10980 ms. (steps per millisecond=0 ) properties (out of 27) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1924 ms. (steps per millisecond=5 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3390 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 08:06:55] [INFO ] Invariant cache hit.
[2023-03-22 08:06:59] [INFO ] [Real]Absence check using 4000 positive place invariants in 1745 ms returned sat
[2023-03-22 08:07:00] [INFO ] After 4753ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 08:07:04] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1708 ms returned sat
[2023-03-22 08:07:25] [INFO ] After 17452ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-22 08:07:25] [INFO ] After 17467ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 08:07:25] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2001 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1280 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1281 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4999 ms. (steps per millisecond=2 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1851 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:07:33] [INFO ] Invariant cache hit.
[2023-03-22 08:07:36] [INFO ] [Real]Absence check using 4000 positive place invariants in 1456 ms returned sat
[2023-03-22 08:07:37] [INFO ] After 3454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:07:40] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1486 ms returned sat
[2023-03-22 08:07:52] [INFO ] After 11557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:07:53] [INFO ] After 12290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 425 ms.
[2023-03-22 08:07:53] [INFO ] After 16075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2000 steps, including 0 resets, run visited all 1 properties in 822 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 829 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA Philosophers-PT-002000-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-002000-LTLCardinality-14 FALSE 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&&(G((p1 U p2))||G(p0)))))'
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 352 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:07:55] [INFO ] Invariant cache hit.
[2023-03-22 08:07:56] [INFO ] Implicit Places using invariants in 1343 ms returned []
Implicit Place search using SMT only with invariants took 1354 ms to find 0 implicit places.
[2023-03-22 08:07:56] [INFO ] Invariant cache hit.
[2023-03-22 08:07:57] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2859 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 7980 steps with 0 reset in 10008 ms.
Product exploration timeout after 7900 steps with 0 reset in 10005 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 p2 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (AND p0 p2) (AND p0 p1))))]
Knowledge based reduction with 6 factoid took 408 ms. Reduced automaton from 3 states, 14 edges and 3 AP (stutter insensitive) to 3 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6330 ms. (steps per millisecond=1 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4190 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:08:36] [INFO ] Invariant cache hit.
[2023-03-22 08:08:41] [INFO ] [Real]Absence check using 4000 positive place invariants in 1955 ms returned sat
[2023-03-22 08:08:44] [INFO ] After 6899ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 730 ms. Reduced automaton from 3 states, 14 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 383 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:08:46] [INFO ] Invariant cache hit.
[2023-03-22 08:08:47] [INFO ] Implicit Places using invariants in 1351 ms returned []
Implicit Place search using SMT only with invariants took 1365 ms to find 0 implicit places.
[2023-03-22 08:08:47] [INFO ] Invariant cache hit.
[2023-03-22 08:08:48] [INFO ] Dead Transitions using invariants and state equation in 1147 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2911 ms. Remains : 10000/10000 places, 10000/10000 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 p2 (NOT p1)), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2)))]
Knowledge based reduction with 5 factoid took 408 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Finished random walk after 174 steps, including 0 resets, run visited all 6 properties in 263 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) p2) (AND p1 (NOT p2)))), (F (AND p0 (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 454 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Product exploration timeout after 13770 steps with 0 reset in 10002 ms.
Product exploration timeout after 13120 steps with 0 reset in 10004 ms.
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 145 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:09:15] [INFO ] Invariant cache hit.
[2023-03-22 08:09:16] [INFO ] Implicit Places using invariants in 1349 ms returned []
Implicit Place search using SMT only with invariants took 1370 ms to find 0 implicit places.
[2023-03-22 08:09:16] [INFO ] Invariant cache hit.
[2023-03-22 08:09:17] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2385 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-00 finished in 83625 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 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 751 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:09:19] [INFO ] Invariant cache hit.
[2023-03-22 08:09:20] [INFO ] Implicit Places using invariants in 1365 ms returned []
Implicit Place search using SMT only with invariants took 1378 ms to find 0 implicit places.
[2023-03-22 08:09:20] [INFO ] Invariant cache hit.
[2023-03-22 08:09:21] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3341 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-01 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:(LEQ 3 (ADD s7677 s7678 s7679 s7680 s7681 s7682 s7683 s7684 s7685 s7686 s7687 s7688 s7689 s7690 s7691 s7692 s7693 s7694 s7695 s7696 s7697 s7698 s7699 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 12840 steps with 92 reset in 10003 ms.
Product exploration timeout after 12670 steps with 80 reset in 10007 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 129 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 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 138 steps, including 0 resets, run visited all 1 properties in 110 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 99 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2023-03-22 08:09:44] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 830 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:10:00] [INFO ] Invariant cache hit.
[2023-03-22 08:10:02] [INFO ] Implicit Places using invariants in 1198 ms returned []
Implicit Place search using SMT only with invariants took 1201 ms to find 0 implicit places.
[2023-03-22 08:10:02] [INFO ] Invariant cache hit.
[2023-03-22 08:10:03] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3167 ms. Remains : 10000/10000 places, 10000/10000 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 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 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 145 steps, including 0 resets, run visited all 1 properties in 115 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 101 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-22 08:10:06] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 12900 steps with 82 reset in 10007 ms.
Product exploration timeout after 12540 steps with 82 reset in 10002 ms.
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 800 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:10:42] [INFO ] Invariant cache hit.
[2023-03-22 08:10:43] [INFO ] Implicit Places using invariants in 1160 ms returned []
Implicit Place search using SMT only with invariants took 1161 ms to find 0 implicit places.
[2023-03-22 08:10:43] [INFO ] Invariant cache hit.
[2023-03-22 08:10:44] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3065 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-01 finished in 86520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 353 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:10:45] [INFO ] Invariant cache hit.
[2023-03-22 08:10:46] [INFO ] Implicit Places using invariants in 1142 ms returned []
Implicit Place search using SMT only with invariants took 1144 ms to find 0 implicit places.
[2023-03-22 08:10:46] [INFO ] Invariant cache hit.
[2023-03-22 08:10:47] [INFO ] Dead Transitions using invariants and state equation in 1164 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2665 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-03 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=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ (ADD s5661 s5662 s5663 s5664 s5665 s5666 s5667 s5668 s5672 s5673 s5674 s5675 s5676 s5757 s5758 s5759 s5760 s5761 s5762 s5763 s5764 s5765 s5766 s57...], 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, null][true, true, true]]
Product exploration timeout after 15230 steps with 0 reset in 10004 ms.
Product exploration timeout after 15030 steps with 0 reset in 10004 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 6092 steps, including 1 resets, run visited all 4 properties in 5181 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-002000-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-002000-LTLCardinality-03 finished in 31105 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((G(!p0)||(G(p1) U p0))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 381 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:11:16] [INFO ] Invariant cache hit.
[2023-03-22 08:11:17] [INFO ] Implicit Places using invariants in 1128 ms returned []
Implicit Place search using SMT only with invariants took 1131 ms to find 0 implicit places.
[2023-03-22 08:11:17] [INFO ] Invariant cache hit.
[2023-03-22 08:11:18] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2720 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, false, (AND (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ (ADD s5661 s5662 s5663 s5664 s5665 s5666 s5667 s5668 s5672 s5673 s5674 s5675 s5676 s5757 s5758 s5759 s5760 s5761 s5762 s5763 s5764 s5765 s5766 s57...], 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, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2781 steps with 0 reset in 3104 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-04 finished in 6077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 569 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:11:22] [INFO ] Invariant cache hit.
[2023-03-22 08:11:23] [INFO ] Implicit Places using invariants in 1146 ms returned []
Implicit Place search using SMT only with invariants took 1157 ms to find 0 implicit places.
[2023-03-22 08:11:23] [INFO ] Invariant cache hit.
[2023-03-22 08:11:25] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2759 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT 2 (ADD s1917 s1918 s1919 s1920 s1921 s1922 s1923 s1924 s1925 s1926 s1927 s1928 s1929 s1930 s1931 s1932 s1933 s1934 s1935 s1936 s1937 s1938 s193...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 19310 steps with 0 reset in 10004 ms.
Product exploration timeout after 18910 steps with 0 reset in 10003 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)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 514 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:11:46] [INFO ] Invariant cache hit.
[2023-03-22 08:11:48] [INFO ] Implicit Places using invariants in 1112 ms returned []
Implicit Place search using SMT only with invariants took 1114 ms to find 0 implicit places.
[2023-03-22 08:11:48] [INFO ] Invariant cache hit.
[2023-03-22 08:11:49] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2640 ms. Remains : 10000/10000 places, 10000/10000 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)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0)]
Product exploration timeout after 18930 steps with 0 reset in 10001 ms.
Product exploration timeout after 19330 steps with 0 reset in 10003 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 537 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:12:11] [INFO ] Invariant cache hit.
[2023-03-22 08:12:12] [INFO ] Implicit Places using invariants in 1156 ms returned []
Implicit Place search using SMT only with invariants took 1158 ms to find 0 implicit places.
[2023-03-22 08:12:12] [INFO ] Invariant cache hit.
[2023-03-22 08:12:13] [INFO ] Dead Transitions using invariants and state equation in 1156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2855 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-07 finished in 51538 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)||X(G(p1)))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1117 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:12:14] [INFO ] Invariant cache hit.
[2023-03-22 08:12:16] [INFO ] Implicit Places using invariants in 1163 ms returned []
Implicit Place search using SMT only with invariants took 1168 ms to find 0 implicit places.
[2023-03-22 08:12:16] [INFO ] Invariant cache hit.
[2023-03-22 08:12:17] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3366 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s9658), p1:(GT s3220 s9665)], 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 timeout after 45130 steps with 5 reset in 10005 ms.
Product exploration timeout after 57180 steps with 3 reset in 10003 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 p0) p1), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3830 ms. (steps per millisecond=2 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:12:42] [INFO ] Invariant cache hit.
[2023-03-22 08:12:45] [INFO ] [Real]Absence check using 4000 positive place invariants in 1461 ms returned sat
[2023-03-22 08:12:56] [INFO ] After 10972ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 08:12:56] [INFO ] After 11599ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 336 ms.
[2023-03-22 08:12:57] [INFO ] After 14894ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1059 steps, including 0 resets, run visited all 1 properties in 315 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 319 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1163 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:12:59] [INFO ] Invariant cache hit.
[2023-03-22 08:13:00] [INFO ] Implicit Places using invariants in 1098 ms returned []
Implicit Place search using SMT only with invariants took 1112 ms to find 0 implicit places.
[2023-03-22 08:13:00] [INFO ] Invariant cache hit.
[2023-03-22 08:13:01] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3402 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5238 steps, including 1 resets, run visited all 3 properties in 2186 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 54970 steps with 3 reset in 10001 ms.
Product exploration timeout after 33940 steps with 6 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1996 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1996 places in 1 ms
Iterating global reduction 0 with 1996 rules applied. Total rules applied 1996 place count 10000 transition count 10000
Deduced a syphon composed of 1996 places in 2 ms
Applied a total of 1996 rules in 3290 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-22 08:13:28] [INFO ] Computed 4000 place invariants in 32 ms
[2023-03-22 08:13:29] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10000/10000 places, 10000/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4435 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1010 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-22 08:13:30] [INFO ] Computed 4000 place invariants in 22 ms
[2023-03-22 08:13:31] [INFO ] Implicit Places using invariants in 1252 ms returned []
Implicit Place search using SMT only with invariants took 1256 ms to find 0 implicit places.
[2023-03-22 08:13:31] [INFO ] Invariant cache hit.
[2023-03-22 08:13:32] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3413 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-08 finished in 79488 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||(p0 U p1)))&&(p2 U (p3||G(p2)))))'
Support contains 8 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1991 Post agglomeration using F-continuation condition.Transition count delta: 1991
Deduced a syphon composed of 1991 places in 1 ms
Reduce places removed 1991 places and 0 transitions.
Iterating global reduction 0 with 3982 rules applied. Total rules applied 3982 place count 8009 transition count 8009
Applied a total of 3982 rules in 2609 ms. Remains 8009 /10000 variables (removed 1991) and now considering 8009/10000 (removed 1991) transitions.
// Phase 1: matrix 8009 rows 8009 cols
[2023-03-22 08:13:35] [INFO ] Computed 4000 place invariants in 21 ms
[2023-03-22 08:13:43] [INFO ] Implicit Places using invariants in 7506 ms returned []
[2023-03-22 08:13:43] [INFO ] Invariant cache hit.
[2023-03-22 08:13:51] [INFO ] Implicit Places using invariants and state equation in 7995 ms returned []
Implicit Place search using SMT with State Equation took 15503 ms to find 0 implicit places.
[2023-03-22 08:13:52] [INFO ] Redundant transitions in 1009 ms returned []
[2023-03-22 08:13:52] [INFO ] Invariant cache hit.
[2023-03-22 08:13:53] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8009/10000 places, 8009/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20073 ms. Remains : 8009/10000 places, 8009/10000 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p3) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p0 (NOT p3) p2) (AND p1 (NOT p3) p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p3:(LEQ s7532 s3409), p2:(LEQ s1575 s3709), p0:(LEQ s124 s8001), p1:(AND (LEQ s124 s8001) (LEQ s3798 s5471))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 17700 steps with 13 reset in 10005 ms.
Stack based approach found an accepted trace after 3500 steps with 1 reset with depth 3374 and stack size 3374 in 1794 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-09 finished in 32140 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&&X(p1)))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1022 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-22 08:14:06] [INFO ] Computed 4000 place invariants in 22 ms
[2023-03-22 08:14:07] [INFO ] Implicit Places using invariants in 1257 ms returned []
Implicit Place search using SMT only with invariants took 1259 ms to find 0 implicit places.
[2023-03-22 08:14:07] [INFO ] Invariant cache hit.
[2023-03-22 08:14:08] [INFO ] Dead Transitions using invariants and state equation in 1245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3531 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s7263 s3140) (LEQ 3 s5429)), p1:(LEQ s7263 s3140)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 17530 steps with 5767 reset in 10008 ms.
Product exploration timeout after 17370 steps with 5838 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3821 ms. (steps per millisecond=2 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:14:34] [INFO ] Invariant cache hit.
[2023-03-22 08:14:35] [INFO ] After 1326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:14:38] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1552 ms returned sat
[2023-03-22 08:14:38] [INFO ] After 2862ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1023 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:14:39] [INFO ] Invariant cache hit.
[2023-03-22 08:14:40] [INFO ] Implicit Places using invariants in 1109 ms returned []
Implicit Place search using SMT only with invariants took 1110 ms to find 0 implicit places.
[2023-03-22 08:14:40] [INFO ] Invariant cache hit.
[2023-03-22 08:14:42] [INFO ] Dead Transitions using invariants and state equation in 1219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3361 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 1329 steps, including 0 resets, run visited all 2 properties in 793 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration timeout after 17970 steps with 6009 reset in 10003 ms.
Product exploration timeout after 17470 steps with 5773 reset in 10005 ms.
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 999 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 08:15:05] [INFO ] Invariant cache hit.
[2023-03-22 08:15:06] [INFO ] Implicit Places using invariants in 1205 ms returned []
Implicit Place search using SMT only with invariants took 1206 ms to find 0 implicit places.
[2023-03-22 08:15:06] [INFO ] Invariant cache hit.
[2023-03-22 08:15:07] [INFO ] Dead Transitions using invariants and state equation in 1211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3417 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-10 finished in 62473 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)&&(p1 U (G(p1)||(p1&&G(p2))))))'
Support contains 6 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1995 Post agglomeration using F-continuation condition.Transition count delta: 1995
Deduced a syphon composed of 1995 places in 1 ms
Reduce places removed 1995 places and 0 transitions.
Iterating global reduction 0 with 3990 rules applied. Total rules applied 3990 place count 8005 transition count 8005
Applied a total of 3990 rules in 2185 ms. Remains 8005 /10000 variables (removed 1995) and now considering 8005/10000 (removed 1995) transitions.
// Phase 1: matrix 8005 rows 8005 cols
[2023-03-22 08:15:10] [INFO ] Computed 4000 place invariants in 21 ms
[2023-03-22 08:15:17] [INFO ] Implicit Places using invariants in 7425 ms returned []
[2023-03-22 08:15:17] [INFO ] Invariant cache hit.
[2023-03-22 08:15:24] [INFO ] Implicit Places using invariants and state equation in 6991 ms returned []
Implicit Place search using SMT with State Equation took 14437 ms to find 0 implicit places.
[2023-03-22 08:15:25] [INFO ] Redundant transitions in 671 ms returned []
[2023-03-22 08:15:25] [INFO ] Invariant cache hit.
[2023-03-22 08:15:31] [INFO ] Dead Transitions using invariants and state equation in 6767 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8005/10000 places, 8005/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24069 ms. Remains : 8005/10000 places, 8005/10000 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) p0), true, p0, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GT s2267 s5626), p0:(OR (LEQ 2 s8002) (LEQ s2921 s5464)), p2:(LEQ 1 s6767)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 178 steps with 0 reset in 129 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-12 finished in 24435 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(X((F(X(p0)) U p1))))'
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 993 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-22 08:15:33] [INFO ] Computed 4000 place invariants in 23 ms
[2023-03-22 08:15:34] [INFO ] Implicit Places using invariants in 1145 ms returned []
Implicit Place search using SMT only with invariants took 1147 ms to find 0 implicit places.
[2023-03-22 08:15:34] [INFO ] Invariant cache hit.
[2023-03-22 08:15:35] [INFO ] Dead Transitions using invariants and state equation in 1003 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3164 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ s704 s8873) (LEQ s9956 s5412))], 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]]
Product exploration timeout after 21560 steps with 16 reset in 10002 ms.
Product exploration timeout after 27010 steps with 12 reset in 10003 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 : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Finished random walk after 295 steps, including 0 resets, run visited all 1 properties in 209 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F p1)]
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
[2023-03-22 08:15:56] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1997 Post agglomeration using F-continuation condition.Transition count delta: 1997
Deduced a syphon composed of 1997 places in 2 ms
Reduce places removed 1997 places and 0 transitions.
Iterating global reduction 0 with 3994 rules applied. Total rules applied 3994 place count 8003 transition count 8003
Applied a total of 3994 rules in 2363 ms. Remains 8003 /10000 variables (removed 1997) and now considering 8003/10000 (removed 1997) transitions.
// Phase 1: matrix 8003 rows 8003 cols
[2023-03-22 08:16:13] [INFO ] Computed 4000 place invariants in 15 ms
[2023-03-22 08:16:21] [INFO ] Implicit Places using invariants in 7362 ms returned []
[2023-03-22 08:16:21] [INFO ] Invariant cache hit.
[2023-03-22 08:16:28] [INFO ] Implicit Places using invariants and state equation in 7249 ms returned []
Implicit Place search using SMT with State Equation took 14624 ms to find 0 implicit places.
[2023-03-22 08:16:29] [INFO ] Redundant transitions in 931 ms returned []
[2023-03-22 08:16:29] [INFO ] Invariant cache hit.
[2023-03-22 08:16:36] [INFO ] Dead Transitions using invariants and state equation in 7413 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8003/10000 places, 8003/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25366 ms. Remains : 8003/10000 places, 8003/10000 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 : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Finished random walk after 1335 steps, including 0 resets, run visited all 1 properties in 816 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F p1)]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
[2023-03-22 08:16:38] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Product exploration timeout after 28410 steps with 12 reset in 10003 ms.
Stack based approach found an accepted trace after 3208 steps with 2 reset with depth 71 and stack size 71 in 1965 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-13 finished in 92899 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 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 981 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-22 08:17:06] [INFO ] Computed 4000 place invariants in 22 ms
[2023-03-22 08:17:07] [INFO ] Implicit Places using invariants in 1116 ms returned []
Implicit Place search using SMT only with invariants took 1127 ms to find 0 implicit places.
[2023-03-22 08:17:07] [INFO ] Invariant cache hit.
[2023-03-22 08:17:08] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3217 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-002000-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:(LEQ s1506 s8453)], 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]]
Product exploration timeout after 18900 steps with 17 reset in 10004 ms.
Product exploration timeout after 22130 steps with 11 reset in 10004 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 353 steps, including 0 resets, run visited all 1 properties in 254 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-22 08:17:29] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1998 Post agglomeration using F-continuation condition.Transition count delta: 1998
Deduced a syphon composed of 1998 places in 2 ms
Reduce places removed 1998 places and 0 transitions.
Iterating global reduction 0 with 3996 rules applied. Total rules applied 3996 place count 8002 transition count 8002
Applied a total of 3996 rules in 2362 ms. Remains 8002 /10000 variables (removed 1998) and now considering 8002/10000 (removed 1998) transitions.
// Phase 1: matrix 8002 rows 8002 cols
[2023-03-22 08:17:46] [INFO ] Computed 4000 place invariants in 18 ms
[2023-03-22 08:17:54] [INFO ] Implicit Places using invariants in 7426 ms returned []
[2023-03-22 08:17:54] [INFO ] Invariant cache hit.
[2023-03-22 08:18:01] [INFO ] Implicit Places using invariants and state equation in 7238 ms returned []
Implicit Place search using SMT with State Equation took 14678 ms to find 0 implicit places.
[2023-03-22 08:18:02] [INFO ] Redundant transitions in 911 ms returned []
[2023-03-22 08:18:02] [INFO ] Invariant cache hit.
[2023-03-22 08:18:08] [INFO ] Dead Transitions using invariants and state equation in 6207 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8002/10000 places, 8002/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24179 ms. Remains : 8002/10000 places, 8002/10000 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 452 steps, including 0 resets, run visited all 1 properties in 318 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-22 08:18:09] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration timeout after 20610 steps with 15 reset in 10001 ms.
Stack based approach found an accepted trace after 5180 steps with 5 reset with depth 1346 and stack size 1346 in 3366 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-15 finished in 92740 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&&(G((p1 U p2))||G(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
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&&X(p1)))))'
Found a Shortening insensitive property : Philosophers-PT-002000-LTLCardinality-10
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1998 Post agglomeration using F-continuation condition.Transition count delta: 1998
Deduced a syphon composed of 1998 places in 1 ms
Reduce places removed 1998 places and 0 transitions.
Iterating global reduction 0 with 3996 rules applied. Total rules applied 3996 place count 8002 transition count 8002
Applied a total of 3996 rules in 2426 ms. Remains 8002 /10000 variables (removed 1998) and now considering 8002/10000 (removed 1998) transitions.
// Phase 1: matrix 8002 rows 8002 cols
[2023-03-22 08:18:40] [INFO ] Computed 4000 place invariants in 13 ms
[2023-03-22 08:18:48] [INFO ] Implicit Places using invariants in 7567 ms returned []
[2023-03-22 08:18:48] [INFO ] Invariant cache hit.
[2023-03-22 08:18:55] [INFO ] Implicit Places using invariants and state equation in 7298 ms returned []
Implicit Place search using SMT with State Equation took 14879 ms to find 0 implicit places.
[2023-03-22 08:18:55] [INFO ] Invariant cache hit.
[2023-03-22 08:19:02] [INFO ] Dead Transitions using invariants and state equation in 7022 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8002/10000 places, 8002/10000 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 24337 ms. Remains : 8002/10000 places, 8002/10000 transitions.
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s7263 s3140) (LEQ 3 s5429)), p1:(LEQ s7263 s3140)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 17930 steps with 5910 reset in 10002 ms.
Product exploration timeout after 17590 steps with 5799 reset in 10005 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4962 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 195729 steps, run timeout after 18035 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 195729 steps, saw 195534 distinct states, run finished after 18036 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 08:19:47] [INFO ] Invariant cache hit.
[2023-03-22 08:19:49] [INFO ] After 1164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 08:19:51] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1249 ms returned sat
[2023-03-22 08:20:04] [INFO ] After 12660ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-22 08:20:05] [INFO ] After 13591ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 592 ms.
[2023-03-22 08:20:05] [INFO ] After 16779ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1019 steps, including 0 resets, run visited all 2 properties in 234 ms. (steps per millisecond=4 )
Parikh walk visited 2 properties in 236 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 8002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8002/8002 places, 8002/8002 transitions.
Applied a total of 0 rules in 579 ms. Remains 8002 /8002 variables (removed 0) and now considering 8002/8002 (removed 0) transitions.
[2023-03-22 08:20:07] [INFO ] Invariant cache hit.
[2023-03-22 08:20:14] [INFO ] Implicit Places using invariants in 7462 ms returned []
[2023-03-22 08:20:14] [INFO ] Invariant cache hit.
[2023-03-22 08:20:15] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 8394 ms to find 0 implicit places.
[2023-03-22 08:20:15] [INFO ] Invariant cache hit.
[2023-03-22 08:20:22] [INFO ] Dead Transitions using invariants and state equation in 6702 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15677 ms. Remains : 8002/8002 places, 8002/8002 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 1747 steps, including 0 resets, run visited all 2 properties in 1051 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration timeout after 18300 steps with 6133 reset in 10006 ms.
Product exploration timeout after 17740 steps with 5927 reset in 10006 ms.
Support contains 3 out of 8002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8002/8002 places, 8002/8002 transitions.
Applied a total of 0 rules in 577 ms. Remains 8002 /8002 variables (removed 0) and now considering 8002/8002 (removed 0) transitions.
[2023-03-22 08:20:45] [INFO ] Invariant cache hit.
[2023-03-22 08:20:52] [INFO ] Implicit Places using invariants in 7113 ms returned []
[2023-03-22 08:20:52] [INFO ] Invariant cache hit.
[2023-03-22 08:20:59] [INFO ] Implicit Places using invariants and state equation in 7278 ms returned []
Implicit Place search using SMT with State Equation took 14414 ms to find 0 implicit places.
[2023-03-22 08:20:59] [INFO ] Invariant cache hit.
[2023-03-22 08:21:06] [INFO ] Dead Transitions using invariants and state equation in 6813 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21806 ms. Remains : 8002/8002 places, 8002/8002 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-10 finished in 148339 ms.
[2023-03-22 08:21:07] [INFO ] Flatten gal took : 296 ms
[2023-03-22 08:21:07] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 8 ms.
[2023-03-22 08:21:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10000 places, 10000 transitions and 32000 arcs took 109 ms.
Total runtime 881625 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1986/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 15515360 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16026668 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1986/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 15469788 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15982744 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1986/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 15464868 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15977132 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1986/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1986/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Philosophers-PT-002000-LTLCardinality-00
Could not compute solution for formula : Philosophers-PT-002000-LTLCardinality-01
Could not compute solution for formula : Philosophers-PT-002000-LTLCardinality-07
Could not compute solution for formula : Philosophers-PT-002000-LTLCardinality-08
Could not compute solution for formula : Philosophers-PT-002000-LTLCardinality-10

BK_STOP 1679475435853

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Philosophers-PT-002000-LTLCardinality-00
ltl formula formula --ltl=/tmp/1986/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10000 places, 10000 transitions and 32000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1986/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.260 real 0.410 user 0.580 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1986/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1986/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1986/ltl_0_
Killing (15) : 1992 1993 1994 1995 1996
Killing (9) : 1992 1993 1994 1995 1996
ltl formula name Philosophers-PT-002000-LTLCardinality-01
ltl formula formula --ltl=/tmp/1986/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10000 places, 10000 transitions and 32000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.280 real 0.440 user 0.330 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1986/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1986/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1986/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1986/ltl_1_
Killing (15) : 2011 2012 2013 2014 2015
Killing (9) : 2011 2012 2013 2014 2015
ltl formula name Philosophers-PT-002000-LTLCardinality-07
ltl formula formula --ltl=/tmp/1986/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10000 places, 10000 transitions and 32000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.520 real 0.370 user 0.370 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1986/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1986/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1986/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1986/ltl_2_
Killing (15) : 2090 2091 2092 2093 2094
Killing (9) : 2090 2091 2092 2093 2094
ltl formula name Philosophers-PT-002000-LTLCardinality-08
ltl formula formula --ltl=/tmp/1986/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10000 places, 10000 transitions and 32000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.200 real 0.400 user 0.320 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1986/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1986/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1986/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1986/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name Philosophers-PT-002000-LTLCardinality-10
ltl formula formula --ltl=/tmp/1986/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10000 places, 10000 transitions and 32000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.190 real 0.340 user 0.360 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1986/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1986/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1986/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1986/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-002000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Philosophers-PT-002000, 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 r297-tall-167873950200251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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