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.r295-tall-167873947600227.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 lolaxred
Input is Philosophers-PT-000200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947600227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 171K Feb 25 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 960K Feb 25 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 117K Feb 25 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 762K Feb 25 13:14 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 75K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 295K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 332K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 310K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 261K Feb 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 445K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678805080148

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000200
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 14:44:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 14:44:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:44:41] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-14 14:44:41] [INFO ] Transformed 1000 places.
[2023-03-14 14:44:41] [INFO ] Transformed 1000 transitions.
[2023-03-14 14:44:41] [INFO ] Parsed PT model containing 1000 places and 1000 transitions and 3200 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-PT-000200-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1000 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 14:44:42] [INFO ] Computed 400 place invariants in 19 ms
[2023-03-14 14:44:42] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-14 14:44:42] [INFO ] Invariant cache hit.
[2023-03-14 14:44:43] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2023-03-14 14:44:43] [INFO ] Invariant cache hit.
[2023-03-14 14:44:43] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1407 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 1000 out of 1000 places after structural reductions.
[2023-03-14 14:44:43] [INFO ] Flatten gal took : 87 ms
[2023-03-14 14:44:43] [INFO ] Flatten gal took : 59 ms
[2023-03-14 14:44:44] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 29) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-14 14:44:45] [INFO ] Invariant cache hit.
[2023-03-14 14:44:45] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 14:44:46] [INFO ] [Nat]Absence check using 400 positive place invariants in 104 ms returned sat
[2023-03-14 14:44:46] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-PT-000200-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Philosophers-PT-000200-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 75 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:44:46] [INFO ] Invariant cache hit.
[2023-03-14 14:44:46] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-14 14:44:46] [INFO ] Invariant cache hit.
[2023-03-14 14:44:47] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
[2023-03-14 14:44:47] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-14 14:44:47] [INFO ] Invariant cache hit.
[2023-03-14 14:44:48] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1852 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 1 (ADD s765 s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776 s777 s778 s779 s780 s781 s782 s783 s784 s788 s789 s790 s791 s792 s793 s794...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 77231 steps with 0 reset in 1705 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-00 finished in 3752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 36 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:44:50] [INFO ] Invariant cache hit.
[2023-03-14 14:44:50] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-14 14:44:50] [INFO ] Invariant cache hit.
[2023-03-14 14:44:51] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2023-03-14 14:44:51] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-14 14:44:51] [INFO ] Invariant cache hit.
[2023-03-14 14:44:51] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1676 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s765 s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776 s777 s778 s779 s780 s781 s782 s783 s784 s788 s789 s790 s791 s792 s793 s794 s795...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 95336 steps with 0 reset in 2610 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-01 finished in 4348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:44:54] [INFO ] Invariant cache hit.
[2023-03-14 14:44:54] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-14 14:44:54] [INFO ] Invariant cache hit.
[2023-03-14 14:44:55] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-14 14:44:55] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-14 14:44:55] [INFO ] Invariant cache hit.
[2023-03-14 14:44:55] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1219 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 26 reset in 2800 ms.
Stack based approach found an accepted trace after 1912 steps with 0 reset with depth 1913 and stack size 1913 in 85 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-02 finished in 4225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||X(G(p2)))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:44:58] [INFO ] Invariant cache hit.
[2023-03-14 14:44:58] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-14 14:44:58] [INFO ] Invariant cache hit.
[2023-03-14 14:44:59] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2023-03-14 14:44:59] [INFO ] Invariant cache hit.
[2023-03-14 14:45:00] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1377 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ (ADD s381 s382 s383 s384 s385 s386 s387 s388 s390 s393 s394 s395 s396 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3453 ms.
Product exploration explored 100000 steps with 50000 reset in 3542 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000200-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000200-LTLCardinality-05 finished in 13428 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 G(p1)))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 61 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:45:12] [INFO ] Invariant cache hit.
[2023-03-14 14:45:12] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-14 14:45:12] [INFO ] Invariant cache hit.
[2023-03-14 14:45:13] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2023-03-14 14:45:13] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-14 14:45:13] [INFO ] Invariant cache hit.
[2023-03-14 14:45:13] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1593 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 (ADD s573 s574 s575 s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3 reset in 2852 ms.
Stack based approach found an accepted trace after 98180 steps with 1 reset with depth 67248 and stack size 17651 in 2639 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-06 finished in 7219 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||X(G(p1)))))'
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 28 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:45:19] [INFO ] Invariant cache hit.
[2023-03-14 14:45:19] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-14 14:45:19] [INFO ] Invariant cache hit.
[2023-03-14 14:45:20] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2023-03-14 14:45:20] [INFO ] Invariant cache hit.
[2023-03-14 14:45:20] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1601 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-07 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 2 (ADD s573 s574 s575 s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-07 finished in 1740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Deduced a syphon composed of 199 places in 0 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 801 transition count 801
Applied a total of 398 rules in 136 ms. Remains 801 /1000 variables (removed 199) and now considering 801/1000 (removed 199) transitions.
// Phase 1: matrix 801 rows 801 cols
[2023-03-14 14:45:21] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-14 14:45:21] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-14 14:45:21] [INFO ] Invariant cache hit.
[2023-03-14 14:45:22] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
[2023-03-14 14:45:22] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-14 14:45:22] [INFO ] Invariant cache hit.
[2023-03-14 14:45:22] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/1000 places, 801/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1756 ms. Remains : 801/1000 places, 801/1000 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s800)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15656 steps with 18 reset in 327 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-08 finished in 2174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F(p1)||G(p2)))))'
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 14:45:23] [INFO ] Computed 400 place invariants in 7 ms
[2023-03-14 14:45:23] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-14 14:45:23] [INFO ] Invariant cache hit.
[2023-03-14 14:45:24] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
[2023-03-14 14:45:24] [INFO ] Invariant cache hit.
[2023-03-14 14:45:24] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1717 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GT 1 s392), p0:(LEQ s428 s169), p2:(GT s315 s451)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 908 reset in 4200 ms.
Product exploration explored 100000 steps with 876 reset in 4311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 654 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2316 steps, including 0 resets, run visited all 9 properties in 42 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 826 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:45:36] [INFO ] Invariant cache hit.
[2023-03-14 14:45:37] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-14 14:45:37] [INFO ] Invariant cache hit.
[2023-03-14 14:45:38] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2023-03-14 14:45:38] [INFO ] Invariant cache hit.
[2023-03-14 14:45:38] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1710 ms. Remains : 1000/1000 places, 1000/1000 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 p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 520 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 9) seen :8
Finished Best-First random walk after 800 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=114 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 690 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 880 reset in 4188 ms.
Product exploration explored 100000 steps with 854 reset in 4292 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 195 places in 0 ms
Iterating global reduction 0 with 195 rules applied. Total rules applied 195 place count 1000 transition count 1000
Deduced a syphon composed of 195 places in 0 ms
Applied a total of 195 rules in 111 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:45:50] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 14:45:50] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-14 14:45:50] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 1000/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 14:45:50] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-14 14:45:51] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-14 14:45:51] [INFO ] Invariant cache hit.
[2023-03-14 14:45:52] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
[2023-03-14 14:45:52] [INFO ] Invariant cache hit.
[2023-03-14 14:45:52] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1720 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-PT-000200-LTLCardinality-10 finished in 29616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((((G(p0) U p1) U p2)&&X(p2))))))'
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:45:52] [INFO ] Invariant cache hit.
[2023-03-14 14:45:53] [INFO ] Implicit Places using invariants in 529 ms returned []
[2023-03-14 14:45:53] [INFO ] Invariant cache hit.
[2023-03-14 14:45:54] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
[2023-03-14 14:45:54] [INFO ] Invariant cache hit.
[2023-03-14 14:45:54] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1810 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 5}, { cond=(OR p2 p1), acceptance={} source=0 dest: 6}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 p1 p0), acceptance={0} source=5 dest: 1}, { cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(LEQ s156 s816), p1:(LEQ s684 s341), p0:(LEQ s525 s188)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3082 steps with 0 reset in 41 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-11 finished in 2079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 802 transition count 802
Applied a total of 396 rules in 48 ms. Remains 802 /1000 variables (removed 198) and now considering 802/1000 (removed 198) transitions.
// Phase 1: matrix 802 rows 802 cols
[2023-03-14 14:45:54] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-14 14:45:55] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-14 14:45:55] [INFO ] Invariant cache hit.
[2023-03-14 14:45:56] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
[2023-03-14 14:45:56] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-14 14:45:56] [INFO ] Invariant cache hit.
[2023-03-14 14:45:56] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/1000 places, 802/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1596 ms. Remains : 802/1000 places, 802/1000 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s279 s761)], 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 explored 100000 steps with 943 reset in 4340 ms.
Stack based approach found an accepted trace after 542 steps with 7 reset with depth 103 and stack size 103 in 29 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-15 finished in 6045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F(p1)||G(p2)))))'
[2023-03-14 14:46:01] [INFO ] Flatten gal took : 44 ms
[2023-03-14 14:46:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-14 14:46:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 1000 transitions and 3200 arcs took 7 ms.
Total runtime 79589 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-PT-000200
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1678805217251

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Philosophers-PT-000200-LTLCardinality-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000200-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 4/32 Philosophers-PT-000200-LTLCardinality-10 342292 m, 68458 m/sec, 1077604 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000200-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 8/32 Philosophers-PT-000200-LTLCardinality-10 639098 m, 59361 m/sec, 2167263 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000200-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 11/32 Philosophers-PT-000200-LTLCardinality-10 935830 m, 59346 m/sec, 3245395 t fired, .

Time elapsed: 15 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000200-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 14/32 Philosophers-PT-000200-LTLCardinality-10 1239014 m, 60636 m/sec, 4292449 t fired, .

Time elapsed: 20 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000200-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 16/32 Philosophers-PT-000200-LTLCardinality-10 1457429 m, 43683 m/sec, 5340067 t fired, .

Time elapsed: 25 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000200-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 19/32 Philosophers-PT-000200-LTLCardinality-10 1736885 m, 55891 m/sec, 6408203 t fired, .

Time elapsed: 30 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000200-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 23/32 Philosophers-PT-000200-LTLCardinality-10 2047406 m, 62104 m/sec, 7491229 t fired, .

Time elapsed: 35 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000200-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 26/32 Philosophers-PT-000200-LTLCardinality-10 2339774 m, 58473 m/sec, 8538205 t fired, .

Time elapsed: 40 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000200-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 28/32 Philosophers-PT-000200-LTLCardinality-10 2554532 m, 42951 m/sec, 9584100 t fired, .

Time elapsed: 45 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000200-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 31/32 Philosophers-PT-000200-LTLCardinality-10 2870240 m, 63141 m/sec, 10662645 t fired, .

Time elapsed: 50 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for Philosophers-PT-000200-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000200-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-000200-LTLCardinality-10: LTL unknown AGGR


Time elapsed: 55 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

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