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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 9.1K Feb 25 14:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 14:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:28 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 3.7K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 25 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 31K 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-COL-000500-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679452297230

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-COL-000500
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 02:31:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:31:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:31:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 02:31:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 02:31:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 694 ms
[2023-03-22 02:31:40] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 2500 PT places and 2500.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 02:31:40] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-22 02:31:40] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000500-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10039 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=401 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-22 02:31:40] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-22 02:31:40] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:31:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 02:31:40] [INFO ] After 29ms 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.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-22 02:31:40] [INFO ] Flatten gal took : 15 ms
[2023-03-22 02:31:40] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Philosophers-COL-000500-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 02:31:40] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 500) 500) 500)]] contains successor/predecessor on variables of sort Philo
[2023-03-22 02:31:40] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions 8000 arcs in 51 ms.
[2023-03-22 02:31:40] [INFO ] Unfolded 12 HLPN properties in 3 ms.
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 30 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-22 02:31:41] [INFO ] Computed 1000 place invariants in 39 ms
[2023-03-22 02:31:41] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-22 02:31:41] [INFO ] Invariant cache hit.
[2023-03-22 02:31:43] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2305 ms to find 0 implicit places.
[2023-03-22 02:31:43] [INFO ] Invariant cache hit.
[2023-03-22 02:31:46] [INFO ] Dead Transitions using invariants and state equation in 3221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5561 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2023-03-22 02:31:46] [INFO ] Flatten gal took : 206 ms
[2023-03-22 02:31:47] [INFO ] Flatten gal took : 159 ms
[2023-03-22 02:31:47] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1676 ms. (steps per millisecond=5 ) properties (out of 18) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2023-03-22 02:31:52] [INFO ] Invariant cache hit.
[2023-03-22 02:31:53] [INFO ] [Real]Absence check using 1000 positive place invariants in 277 ms returned sat
[2023-03-22 02:31:55] [INFO ] After 2820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 02:31:56] [INFO ] [Nat]Absence check using 1000 positive place invariants in 207 ms returned sat
[2023-03-22 02:31:59] [INFO ] After 2177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 02:31:59] [INFO ] After 3055ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 443 ms.
[2023-03-22 02:32:00] [INFO ] After 4781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 5 properties in 92 ms. (steps per millisecond=5 )
Parikh walk visited 5 properties in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 250 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:32:01] [INFO ] Invariant cache hit.
[2023-03-22 02:32:02] [INFO ] Implicit Places using invariants in 1586 ms returned []
[2023-03-22 02:32:02] [INFO ] Invariant cache hit.
[2023-03-22 02:32:05] [INFO ] Implicit Places using invariants and state equation in 3133 ms returned []
Implicit Place search using SMT with State Equation took 4725 ms to find 0 implicit places.
[2023-03-22 02:32:05] [INFO ] Invariant cache hit.
[2023-03-22 02:32:09] [INFO ] Dead Transitions using invariants and state equation in 3459 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8453 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 21521 steps with 0 reset in 1050 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-00 finished in 9814 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(F(p1)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 85 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:32:10] [INFO ] Invariant cache hit.
[2023-03-22 02:32:11] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2023-03-22 02:32:11] [INFO ] Invariant cache hit.
[2023-03-22 02:32:14] [INFO ] Implicit Places using invariants and state equation in 2606 ms returned []
Implicit Place search using SMT with State Equation took 3745 ms to find 0 implicit places.
[2023-03-22 02:32:14] [INFO ] Redundant transitions in 151 ms returned []
[2023-03-22 02:32:14] [INFO ] Invariant cache hit.
[2023-03-22 02:32:18] [INFO ] Dead Transitions using invariants and state equation in 3426 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7429 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], 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=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 50090 steps with 672 reset in 10001 ms.
Product exploration timeout after 49030 steps with 642 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 261 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 56 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:32:53] [INFO ] Invariant cache hit.
[2023-03-22 02:32:55] [INFO ] Implicit Places using invariants in 1112 ms returned []
[2023-03-22 02:32:55] [INFO ] Invariant cache hit.
[2023-03-22 02:32:57] [INFO ] Implicit Places using invariants and state equation in 2500 ms returned []
Implicit Place search using SMT with State Equation took 3657 ms to find 0 implicit places.
[2023-03-22 02:32:57] [INFO ] Redundant transitions in 161 ms returned []
[2023-03-22 02:32:57] [INFO ] Invariant cache hit.
[2023-03-22 02:33:01] [INFO ] Dead Transitions using invariants and state equation in 3439 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7331 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 38 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 50650 steps with 670 reset in 10002 ms.
Product exploration timeout after 49190 steps with 665 reset in 10002 ms.
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 136 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:33:36] [INFO ] Invariant cache hit.
[2023-03-22 02:33:38] [INFO ] Implicit Places using invariants in 1199 ms returned []
[2023-03-22 02:33:38] [INFO ] Invariant cache hit.
[2023-03-22 02:33:40] [INFO ] Implicit Places using invariants and state equation in 2449 ms returned []
Implicit Place search using SMT with State Equation took 3662 ms to find 0 implicit places.
[2023-03-22 02:33:40] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-22 02:33:40] [INFO ] Invariant cache hit.
[2023-03-22 02:33:44] [INFO ] Dead Transitions using invariants and state equation in 3424 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7298 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-01 finished in 94083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&G(F(p0)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 54 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:33:44] [INFO ] Invariant cache hit.
[2023-03-22 02:33:45] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2023-03-22 02:33:45] [INFO ] Invariant cache hit.
[2023-03-22 02:33:48] [INFO ] Implicit Places using invariants and state equation in 2629 ms returned []
Implicit Place search using SMT with State Equation took 3828 ms to find 0 implicit places.
[2023-03-22 02:33:48] [INFO ] Invariant cache hit.
[2023-03-22 02:33:51] [INFO ] Dead Transitions using invariants and state equation in 3353 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7251 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(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=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-02 finished in 7555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 34 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:33:52] [INFO ] Invariant cache hit.
[2023-03-22 02:33:53] [INFO ] Implicit Places using invariants in 1590 ms returned []
[2023-03-22 02:33:53] [INFO ] Invariant cache hit.
[2023-03-22 02:33:56] [INFO ] Implicit Places using invariants and state equation in 3011 ms returned []
Implicit Place search using SMT with State Equation took 4619 ms to find 0 implicit places.
[2023-03-22 02:33:56] [INFO ] Invariant cache hit.
[2023-03-22 02:34:00] [INFO ] Dead Transitions using invariants and state equation in 3334 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8013 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT 1 (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 74950 steps with 21364 reset in 10006 ms.
Product exploration timeout after 72270 steps with 20618 reset in 10001 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 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(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 818 ms. (steps per millisecond=12 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 163 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 37 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:35:06] [INFO ] Invariant cache hit.
[2023-03-22 02:35:07] [INFO ] Implicit Places using invariants in 1454 ms returned []
[2023-03-22 02:35:07] [INFO ] Invariant cache hit.
[2023-03-22 02:35:10] [INFO ] Implicit Places using invariants and state equation in 3189 ms returned []
Implicit Place search using SMT with State Equation took 4682 ms to find 0 implicit places.
[2023-03-22 02:35:10] [INFO ] Invariant cache hit.
[2023-03-22 02:35:14] [INFO ] Dead Transitions using invariants and state equation in 3408 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8143 ms. Remains : 2500/2500 places, 2500/2500 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), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(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 774 ms. (steps per millisecond=12 ) properties (out of 2) seen :1
Finished Best-First random walk after 6990 steps, including 1 resets, run visited all 1 properties in 351 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 72930 steps with 20729 reset in 10003 ms.
Product exploration timeout after 70500 steps with 20093 reset in 10002 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 184 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:36:18] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-22 02:36:18] [INFO ] Invariant cache hit.
[2023-03-22 02:36:21] [INFO ] Dead Transitions using invariants and state equation in 3455 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3760 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 27 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:36:21] [INFO ] Invariant cache hit.
[2023-03-22 02:36:23] [INFO ] Implicit Places using invariants in 1566 ms returned []
[2023-03-22 02:36:23] [INFO ] Invariant cache hit.
[2023-03-22 02:36:26] [INFO ] Implicit Places using invariants and state equation in 3082 ms returned []
Implicit Place search using SMT with State Equation took 4667 ms to find 0 implicit places.
[2023-03-22 02:36:26] [INFO ] Invariant cache hit.
[2023-03-22 02:36:29] [INFO ] Dead Transitions using invariants and state equation in 3268 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7963 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-03 finished in 157481 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 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 104 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:36:29] [INFO ] Invariant cache hit.
[2023-03-22 02:36:31] [INFO ] Implicit Places using invariants in 1607 ms returned []
[2023-03-22 02:36:31] [INFO ] Invariant cache hit.
[2023-03-22 02:36:34] [INFO ] Implicit Places using invariants and state equation in 3026 ms returned []
Implicit Place search using SMT with State Equation took 4650 ms to find 0 implicit places.
[2023-03-22 02:36:34] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-22 02:36:34] [INFO ] Invariant cache hit.
[2023-03-22 02:36:37] [INFO ] Dead Transitions using invariants and state equation in 3388 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8227 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], 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=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 5877 ms.
Stack based approach found an accepted trace after 33499 steps with 0 reset with depth 33500 and stack size 21934 in 2279 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-04 finished in 16447 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(F(!p0))&&F(p1)))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 34 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:36:46] [INFO ] Invariant cache hit.
[2023-03-22 02:36:47] [INFO ] Implicit Places using invariants in 1275 ms returned []
[2023-03-22 02:36:47] [INFO ] Invariant cache hit.
[2023-03-22 02:36:50] [INFO ] Implicit Places using invariants and state equation in 2538 ms returned []
Implicit Place search using SMT with State Equation took 3853 ms to find 0 implicit places.
[2023-03-22 02:36:50] [INFO ] Invariant cache hit.
[2023-03-22 02:36:53] [INFO ] Dead Transitions using invariants and state equation in 3347 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7246 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, true, p0, (NOT p1)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5539 ms.
Stack based approach found an accepted trace after 6570 steps with 1 reset with depth 6568 and stack size 6568 in 541 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-05 finished in 13514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0||G(p1)) U X(!p2)) U p3))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 24 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:36:59] [INFO ] Invariant cache hit.
[2023-03-22 02:37:00] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2023-03-22 02:37:00] [INFO ] Invariant cache hit.
[2023-03-22 02:37:02] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 3187 ms to find 0 implicit places.
[2023-03-22 02:37:02] [INFO ] Invariant cache hit.
[2023-03-22 02:37:06] [INFO ] Dead Transitions using invariants and state equation in 3286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6521 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p3), (NOT p3), (NOT p3), p2, (AND (NOT p1) p2), p2, true, (NOT p1)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 4}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(OR (LEQ 2 (ADD s1500 s1501 s1502 s1503 s1504 s1505 s1506 s1507 s1508 s1509 s1510 s1511 s1512 s1513 s1514 s1515 s1516 s1517 s1518 s1519 s1520 s1521 s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 68490 steps with 22814 reset in 10002 ms.
Product exploration timeout after 66650 steps with 22199 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) p2), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))))]
Knowledge based reduction with 3 factoid took 293 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p3), (NOT p3), (NOT p3), p2, (AND (NOT p1) p2), p2, true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1268 ms. (steps per millisecond=7 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 620 ms. (steps per millisecond=16 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 733 ms. (steps per millisecond=13 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 02:38:28] [INFO ] Invariant cache hit.
[2023-03-22 02:38:30] [INFO ] [Real]Absence check using 1000 positive place invariants in 249 ms returned sat
[2023-03-22 02:38:33] [INFO ] After 4032ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-22 02:38:34] [INFO ] [Nat]Absence check using 1000 positive place invariants in 235 ms returned sat
[2023-03-22 02:38:38] [INFO ] After 3176ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-22 02:38:38] [INFO ] After 3344ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-22 02:38:38] [INFO ] After 5103ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 499 steps, including 0 resets, run visited all 1 properties in 70 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 70 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) p2), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) p1 (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1))))), (F (NOT p2)), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F p3), (F (AND (NOT p0) p1 p2)), (F p1), (F (NOT (OR (AND p0 p2) (AND p1 p2))))]
Knowledge based reduction with 6 factoid took 689 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Stuttering acceptance computed with spot in 331 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
[2023-03-22 02:38:40] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 02:38:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND p0 (NOT p3))
Could not prove EG (AND p0 (NOT p3))
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 40 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:38:56] [INFO ] Invariant cache hit.
[2023-03-22 02:38:57] [INFO ] Implicit Places using invariants in 923 ms returned []
[2023-03-22 02:38:57] [INFO ] Invariant cache hit.
[2023-03-22 02:38:59] [INFO ] Implicit Places using invariants and state equation in 2281 ms returned []
Implicit Place search using SMT with State Equation took 3209 ms to find 0 implicit places.
[2023-03-22 02:38:59] [INFO ] Invariant cache hit.
[2023-03-22 02:39:02] [INFO ] Dead Transitions using invariants and state equation in 3500 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6754 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) p2)]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3)))))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1207 ms. (steps per millisecond=8 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 02:39:21] [INFO ] Invariant cache hit.
[2023-03-22 02:39:22] [INFO ] [Real]Absence check using 1000 positive place invariants in 231 ms returned sat
[2023-03-22 02:39:23] [INFO ] After 1557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:39:23] [INFO ] [Nat]Absence check using 1000 positive place invariants in 225 ms returned sat
[2023-03-22 02:39:28] [INFO ] After 3903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:39:28] [INFO ] After 4115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-22 02:39:28] [INFO ] After 5700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 499 steps, including 0 resets, run visited all 1 properties in 44 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 44 ms.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) p2)]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (F (NOT p2)), (F (AND (NOT p0) p2)), (F p1), (F (NOT (AND p0 (NOT p3)))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 260 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Stuttering acceptance computed with spot in 299 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
[2023-03-22 02:39:30] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 02:39:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND p0 (NOT p3))
Could not prove EG (AND p0 (NOT p3))
Stuttering acceptance computed with spot in 313 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Product exploration timeout after 71170 steps with 23708 reset in 10001 ms.
Product exploration timeout after 69710 steps with 23222 reset in 10002 ms.
Applying partial POR strategy [false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 307 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 39 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:40:06] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-22 02:40:06] [INFO ] Invariant cache hit.
[2023-03-22 02:40:10] [INFO ] Dead Transitions using invariants and state equation in 3577 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3680 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 22 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:40:10] [INFO ] Invariant cache hit.
[2023-03-22 02:40:11] [INFO ] Implicit Places using invariants in 947 ms returned []
[2023-03-22 02:40:11] [INFO ] Invariant cache hit.
[2023-03-22 02:40:13] [INFO ] Implicit Places using invariants and state equation in 2264 ms returned []
Implicit Place search using SMT with State Equation took 3213 ms to find 0 implicit places.
[2023-03-22 02:40:13] [INFO ] Invariant cache hit.
[2023-03-22 02:40:16] [INFO ] Dead Transitions using invariants and state equation in 3439 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6689 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-06 finished in 197378 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 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 67 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:40:17] [INFO ] Invariant cache hit.
[2023-03-22 02:40:18] [INFO ] Implicit Places using invariants in 1463 ms returned []
[2023-03-22 02:40:18] [INFO ] Invariant cache hit.
[2023-03-22 02:40:21] [INFO ] Implicit Places using invariants and state equation in 3086 ms returned []
Implicit Place search using SMT with State Equation took 4551 ms to find 0 implicit places.
[2023-03-22 02:40:21] [INFO ] Invariant cache hit.
[2023-03-22 02:40:25] [INFO ] Dead Transitions using invariants and state equation in 3679 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8302 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527...], 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 97820 steps with 48910 reset in 10001 ms.
Product exploration timeout after 94800 steps with 47400 reset in 10001 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), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000500-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000500-LTLCardinality-08 finished in 60829 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 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 69 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:41:17] [INFO ] Invariant cache hit.
[2023-03-22 02:41:19] [INFO ] Implicit Places using invariants in 1395 ms returned []
[2023-03-22 02:41:19] [INFO ] Invariant cache hit.
[2023-03-22 02:41:22] [INFO ] Implicit Places using invariants and state equation in 3037 ms returned []
Implicit Place search using SMT with State Equation took 4444 ms to find 0 implicit places.
[2023-03-22 02:41:22] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-22 02:41:22] [INFO ] Invariant cache hit.
[2023-03-22 02:41:25] [INFO ] Dead Transitions using invariants and state equation in 3338 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7936 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 3111 ms.
Stack based approach found an accepted trace after 7845 steps with 0 reset with depth 7846 and stack size 7846 in 397 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-09 finished in 11507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 30 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:41:29] [INFO ] Invariant cache hit.
[2023-03-22 02:41:30] [INFO ] Implicit Places using invariants in 1416 ms returned []
[2023-03-22 02:41:30] [INFO ] Invariant cache hit.
[2023-03-22 02:41:33] [INFO ] Implicit Places using invariants and state equation in 2823 ms returned []
Implicit Place search using SMT with State Equation took 4262 ms to find 0 implicit places.
[2023-03-22 02:41:33] [INFO ] Invariant cache hit.
[2023-03-22 02:41:37] [INFO ] Dead Transitions using invariants and state equation in 3299 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7616 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s202...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-10 finished in 7724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0 U (p1||G(p0)))))||(F((p0 U (p1||G(p0))))&&X(F(p2)))))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 10 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:41:37] [INFO ] Invariant cache hit.
[2023-03-22 02:41:37] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-22 02:41:37] [INFO ] Invariant cache hit.
[2023-03-22 02:41:40] [INFO ] Implicit Places using invariants and state equation in 2046 ms returned []
Implicit Place search using SMT with State Equation took 2878 ms to find 0 implicit places.
[2023-03-22 02:41:40] [INFO ] Invariant cache hit.
[2023-03-22 02:41:43] [INFO ] Dead Transitions using invariants and state equation in 3117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6025 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 38070 steps with 621 reset in 10003 ms.
Product exploration timeout after 37160 steps with 618 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 p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 443 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1928 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Finished Best-First random walk after 3994 steps, including 0 resets, run visited all 2 properties in 552 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 581 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2023-03-22 02:46:57] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 10 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:47:12] [INFO ] Invariant cache hit.
[2023-03-22 02:47:13] [INFO ] Implicit Places using invariants in 810 ms returned []
[2023-03-22 02:47:13] [INFO ] Invariant cache hit.
[2023-03-22 02:47:15] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 2988 ms to find 0 implicit places.
[2023-03-22 02:47:15] [INFO ] Invariant cache hit.
[2023-03-22 02:47:18] [INFO ] Dead Transitions using invariants and state equation in 3609 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6613 ms. Remains : 2500/2500 places, 2500/2500 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) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 422 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1821 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Finished Best-First random walk after 3994 steps, including 0 resets, run visited all 2 properties in 565 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 578 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2023-03-22 02:50:53] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration timeout after 43010 steps with 714 reset in 10002 ms.
Product exploration timeout after 42020 steps with 691 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 25 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:51:28] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-22 02:51:28] [INFO ] Invariant cache hit.
[2023-03-22 02:51:32] [INFO ] Dead Transitions using invariants and state equation in 3573 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3674 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 11 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:51:32] [INFO ] Invariant cache hit.
[2023-03-22 02:51:33] [INFO ] Implicit Places using invariants in 804 ms returned []
[2023-03-22 02:51:33] [INFO ] Invariant cache hit.
[2023-03-22 02:51:35] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2788 ms to find 0 implicit places.
[2023-03-22 02:51:35] [INFO ] Invariant cache hit.
[2023-03-22 02:51:38] [INFO ] Dead Transitions using invariants and state equation in 3414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6216 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-12 finished in 601594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(p1))))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 51 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:51:38] [INFO ] Invariant cache hit.
[2023-03-22 02:51:40] [INFO ] Implicit Places using invariants in 1629 ms returned []
[2023-03-22 02:51:40] [INFO ] Invariant cache hit.
[2023-03-22 02:51:43] [INFO ] Implicit Places using invariants and state equation in 3175 ms returned []
Implicit Place search using SMT with State Equation took 4820 ms to find 0 implicit places.
[2023-03-22 02:51:43] [INFO ] Invariant cache hit.
[2023-03-22 02:51:47] [INFO ] Dead Transitions using invariants and state equation in 3547 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8421 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ 3 (ADD s1500 s1501 s1502 s1503 s1504 s1505 s1506 s1507 s1508 s1509 s1510 s1511 s1512 s1513 s1514 s1515 s1516 s1517 s1518 s1519 s1520 s1521 s1522 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 92970 steps with 46485 reset in 10001 ms.
Product exploration timeout after 89720 steps with 44860 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000500-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000500-LTLCardinality-15 finished in 57950 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(F(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' '!(X(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : Philosophers-COL-000500-LTLCardinality-03
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 38 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:52:37] [INFO ] Invariant cache hit.
[2023-03-22 02:52:38] [INFO ] Implicit Places using invariants in 1634 ms returned []
[2023-03-22 02:52:38] [INFO ] Invariant cache hit.
[2023-03-22 02:52:42] [INFO ] Implicit Places using invariants and state equation in 3348 ms returned []
Implicit Place search using SMT with State Equation took 4986 ms to find 0 implicit places.
[2023-03-22 02:52:42] [INFO ] Invariant cache hit.
[2023-03-22 02:52:45] [INFO ] Dead Transitions using invariants and state equation in 3586 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8611 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT 1 (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 72730 steps with 20826 reset in 10001 ms.
Product exploration timeout after 69520 steps with 19791 reset in 10001 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 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(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 771 ms. (steps per millisecond=12 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 02:53:54] [INFO ] Invariant cache hit.
[2023-03-22 02:53:55] [INFO ] [Real]Absence check using 1000 positive place invariants in 218 ms returned sat
[2023-03-22 02:53:56] [INFO ] After 1257ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 02:53:57] [INFO ] After 1461ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-22 02:53:57] [INFO ] After 2201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 381 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 34 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 303 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 26 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:53:57] [INFO ] Invariant cache hit.
[2023-03-22 02:53:59] [INFO ] Implicit Places using invariants in 1468 ms returned []
[2023-03-22 02:53:59] [INFO ] Invariant cache hit.
[2023-03-22 02:54:02] [INFO ] Implicit Places using invariants and state equation in 3125 ms returned []
Implicit Place search using SMT with State Equation took 4605 ms to find 0 implicit places.
[2023-03-22 02:54:02] [INFO ] Invariant cache hit.
[2023-03-22 02:54:05] [INFO ] Dead Transitions using invariants and state equation in 3174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7813 ms. Remains : 2500/2500 places, 2500/2500 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), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(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 764 ms. (steps per millisecond=13 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 176 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 73370 steps with 20984 reset in 10001 ms.
Product exploration timeout after 70450 steps with 20099 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 39 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:55:12] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-22 02:55:12] [INFO ] Invariant cache hit.
[2023-03-22 02:55:16] [INFO ] Dead Transitions using invariants and state equation in 3623 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3765 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 26 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:55:16] [INFO ] Invariant cache hit.
[2023-03-22 02:55:17] [INFO ] Implicit Places using invariants in 1463 ms returned []
[2023-03-22 02:55:17] [INFO ] Invariant cache hit.
[2023-03-22 02:55:20] [INFO ] Implicit Places using invariants and state equation in 3079 ms returned []
Implicit Place search using SMT with State Equation took 4575 ms to find 0 implicit places.
[2023-03-22 02:55:20] [INFO ] Invariant cache hit.
[2023-03-22 02:55:24] [INFO ] Dead Transitions using invariants and state equation in 3423 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8025 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-03 finished in 167463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0||G(p1)) U X(!p2)) U p3))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0 U (p1||G(p0)))))||(F((p0 U (p1||G(p0))))&&X(F(p2)))))'
Found a Shortening insensitive property : Philosophers-COL-000500-LTLCardinality-12
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 23 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 02:55:24] [INFO ] Invariant cache hit.
[2023-03-22 02:55:25] [INFO ] Implicit Places using invariants in 839 ms returned []
[2023-03-22 02:55:25] [INFO ] Invariant cache hit.
[2023-03-22 02:55:27] [INFO ] Implicit Places using invariants and state equation in 2138 ms returned []
Implicit Place search using SMT with State Equation took 2979 ms to find 0 implicit places.
[2023-03-22 02:55:27] [INFO ] Invariant cache hit.
[2023-03-22 02:55:30] [INFO ] Dead Transitions using invariants and state equation in 3331 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6337 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 37720 steps with 613 reset in 10001 ms.
Product exploration timeout after 38540 steps with 636 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 454 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1789 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Finished Best-First random walk after 3994 steps, including 0 resets, run visited all 2 properties in 519 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 608 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2023-03-22 03:00:33] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 15 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 03:00:48] [INFO ] Invariant cache hit.
[2023-03-22 03:00:49] [INFO ] Implicit Places using invariants in 786 ms returned []
[2023-03-22 03:00:49] [INFO ] Invariant cache hit.
[2023-03-22 03:00:51] [INFO ] Implicit Places using invariants and state equation in 2242 ms returned []
Implicit Place search using SMT with State Equation took 3031 ms to find 0 implicit places.
[2023-03-22 03:00:51] [INFO ] Invariant cache hit.
[2023-03-22 03:00:55] [INFO ] Dead Transitions using invariants and state equation in 3391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6444 ms. Remains : 2500/2500 places, 2500/2500 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) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 460 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1762 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Finished Best-First random walk after 3994 steps, including 0 resets, run visited all 2 properties in 521 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 523 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2023-03-22 03:04:25] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration timeout after 44330 steps with 730 reset in 10003 ms.
Product exploration timeout after 44230 steps with 731 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 22 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 03:05:01] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-22 03:05:01] [INFO ] Invariant cache hit.
[2023-03-22 03:05:04] [INFO ] Dead Transitions using invariants and state equation in 3248 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3364 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 9 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 03:05:04] [INFO ] Invariant cache hit.
[2023-03-22 03:05:05] [INFO ] Implicit Places using invariants in 783 ms returned []
[2023-03-22 03:05:05] [INFO ] Invariant cache hit.
[2023-03-22 03:05:07] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 2840 ms to find 0 implicit places.
[2023-03-22 03:05:07] [INFO ] Invariant cache hit.
[2023-03-22 03:05:10] [INFO ] Dead Transitions using invariants and state equation in 3102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5961 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-12 finished in 586163 ms.
[2023-03-22 03:05:10] [INFO ] Flatten gal took : 93 ms
[2023-03-22 03:05:10] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 8 ms.
[2023-03-22 03:05:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2500 transitions and 8000 arcs took 10 ms.
Total runtime 2011339 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2500/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 15982036 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16065424 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2500/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15976216 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16061204 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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-COL-000500"
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-COL-000500, 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-167873950000131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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