fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r521-tall-167987246700459
Last Updated
May 14, 2023

About the Execution of LTSMin+red for PGCD-PT-D03N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
420.336 11636.00 18130.00 262.90 TTFFFFFFF?FFFFFF normal

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.r521-tall-167987246700459.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 PGCD-PT-D03N050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246700459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 23 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 7 12:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 7 12:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 7 12:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 12:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 23 15:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 7.4K Mar 31 16:48 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 PGCD-PT-D03N050-LTLCardinality-00
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-01
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-02
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-03
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-04
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-05
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-06
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-07
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-08
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-09
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-10
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-11
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-12
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-13
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-14
FORMULA_NAME PGCD-PT-D03N050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680940903987

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=PGCD-PT-D03N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-08 08:01:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-08 08:01:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 08:01:45] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-04-08 08:01:45] [INFO ] Transformed 12 places.
[2023-04-08 08:01:45] [INFO ] Transformed 12 transitions.
[2023-04-08 08:01:45] [INFO ] Parsed PT model containing 12 places and 12 transitions and 56 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA PGCD-PT-D03N050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D03N050-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D03N050-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D03N050-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 13 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-08 08:01:45] [INFO ] Computed 5 invariants in 7 ms
[2023-04-08 08:01:46] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
[2023-04-08 08:01:46] [INFO ] Invariant cache hit.
[2023-04-08 08:01:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-08 08:01:46] [INFO ] Invariant cache hit.
[2023-04-08 08:01:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 08:01:46] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-08 08:01:46] [INFO ] Invariant cache hit.
[2023-04-08 08:01:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 471 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 11 out of 12 places after structural reductions.
[2023-04-08 08:01:46] [INFO ] Flatten gal took : 13 ms
[2023-04-08 08:01:46] [INFO ] Flatten gal took : 5 ms
[2023-04-08 08:01:46] [INFO ] Input system was already deterministic with 12 transitions.
Finished random walk after 7164 steps, including 2 resets, run visited all 23 properties in 34 ms. (steps per millisecond=210 )
Parikh walk visited 0 properties in 0 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((p0 U p1))||F(p2)))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:46] [INFO ] Invariant cache hit.
[2023-04-08 08:01:46] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 08:01:46] [INFO ] Invariant cache hit.
[2023-04-08 08:01:46] [INFO ] Implicit Places using invariants in 26 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 69 ms. Remains : 10/12 places, 12/12 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PGCD-PT-D03N050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 3 s9), p1:(LEQ s4 s1), p0:(LEQ 1 s8)], 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 4474 reset in 242 ms.
Stack based approach found an accepted trace after 26 steps with 2 reset with depth 7 and stack size 7 in 1 ms.
FORMULA PGCD-PT-D03N050-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-PT-D03N050-LTLCardinality-02 finished in 640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X(p1))) U (G((p0||X(X(p1))))||((p0||X(X(p1)))&&(X(p1) U ((p2&&X(p1))||X(G(p1))))))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:47] [INFO ] Invariant cache hit.
[2023-04-08 08:01:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 08:01:47] [INFO ] Invariant cache hit.
[2023-04-08 08:01:47] [INFO ] Implicit Places using invariants in 33 ms returned [8, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 9/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (NOT p1), true, (NOT p1)]
Running random walk in product with property : PGCD-PT-D03N050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}]], initial=0, aps=[p0:(GT 2 s8), p2:(LEQ s5 s6), p1:(GT 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, 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 22 steps with 3 reset in 1 ms.
FORMULA PGCD-PT-D03N050-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-PT-D03N050-LTLCardinality-03 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:47] [INFO ] Invariant cache hit.
[2023-04-08 08:01:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 08:01:47] [INFO ] Invariant cache hit.
[2023-04-08 08:01:47] [INFO ] Implicit Places using invariants in 37 ms returned [8, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 9/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : PGCD-PT-D03N050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s1), p0:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA PGCD-PT-D03N050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-PT-D03N050-LTLCardinality-04 finished in 199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(!p1)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:48] [INFO ] Invariant cache hit.
[2023-04-08 08:01:48] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 08:01:48] [INFO ] Invariant cache hit.
[2023-04-08 08:01:48] [INFO ] Implicit Places using invariants in 30 ms returned [8, 9, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 9/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, true, p1, (NOT p1)]
Running random walk in product with property : PGCD-PT-D03N050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s8), p0:(LEQ s1 s0)], 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]]
Entered a terminal (fully accepting) state of product in 15 steps with 2 reset in 1 ms.
FORMULA PGCD-PT-D03N050-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-PT-D03N050-LTLCardinality-06 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:48] [INFO ] Invariant cache hit.
[2023-04-08 08:01:48] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-04-08 08:01:48] [INFO ] Invariant cache hit.
[2023-04-08 08:01:48] [INFO ] Implicit Places using invariants in 27 ms returned [9, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 9/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PGCD-PT-D03N050-LTLCardinality-07 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 s1 s8)], 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 explored 100000 steps with 19214 reset in 132 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA PGCD-PT-D03N050-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-PT-D03N050-LTLCardinality-07 finished in 276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||X(p2))))))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:48] [INFO ] Invariant cache hit.
[2023-04-08 08:01:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-04-08 08:01:48] [INFO ] Invariant cache hit.
[2023-04-08 08:01:48] [INFO ] Implicit Places using invariants in 27 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 30 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 8/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PGCD-PT-D03N050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s4 s0), p0:(OR (LEQ s4 s0) (GT s5 s3)), p2:(LEQ s4 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 262 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA PGCD-PT-D03N050-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-PT-D03N050-LTLCardinality-08 finished in 438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F((p0&&G(p1)))))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:48] [INFO ] Invariant cache hit.
[2023-04-08 08:01:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 08:01:48] [INFO ] Invariant cache hit.
[2023-04-08 08:01:49] [INFO ] Implicit Places using invariants in 29 ms returned [8, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 9/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PGCD-PT-D03N050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s8 s0), p1:(LEQ 1 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 155 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 416 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=910 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 9 cols
[2023-04-08 08:01:49] [INFO ] Computed 2 invariants in 0 ms
[2023-04-08 08:01:50] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 08:01:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 08:01:50] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (OR (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 530 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:50] [INFO ] Invariant cache hit.
[2023-04-08 08:01:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 08:01:50] [INFO ] Invariant cache hit.
[2023-04-08 08:01:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-08 08:01:50] [INFO ] Invariant cache hit.
[2023-04-08 08:01:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 08:01:50] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-08 08:01:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 08:01:50] [INFO ] Invariant cache hit.
[2023-04-08 08:01:50] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 9/9 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 374 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 08:01:51] [INFO ] Invariant cache hit.
[2023-04-08 08:01:51] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 08:01:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 08:01:51] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (OR (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 578 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 187 ms.
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:52] [INFO ] Invariant cache hit.
[2023-04-08 08:01:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-04-08 08:01:52] [INFO ] Invariant cache hit.
[2023-04-08 08:01:52] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 08:01:52] [INFO ] Invariant cache hit.
[2023-04-08 08:01:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-08 08:01:52] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-08 08:01:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 08:01:52] [INFO ] Invariant cache hit.
[2023-04-08 08:01:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 9/9 places, 12/12 transitions.
Treatment of property PGCD-PT-D03N050-LTLCardinality-09 finished in 4027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p0)||X(F(!p1)))))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-08 08:01:52] [INFO ] Computed 5 invariants in 2 ms
[2023-04-08 08:01:53] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-04-08 08:01:53] [INFO ] Invariant cache hit.
[2023-04-08 08:01:53] [INFO ] Implicit Places using invariants in 24 ms returned [8, 9, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 9/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : PGCD-PT-D03N050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s4 s0), p1:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 140 reset in 112 ms.
Stack based approach found an accepted trace after 4052 steps with 36 reset with depth 1590 and stack size 1499 in 5 ms.
FORMULA PGCD-PT-D03N050-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-PT-D03N050-LTLCardinality-10 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:53] [INFO ] Invariant cache hit.
[2023-04-08 08:01:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-04-08 08:01:53] [INFO ] Invariant cache hit.
[2023-04-08 08:01:53] [INFO ] Implicit Places using invariants in 27 ms returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56 ms. Remains : 10/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PGCD-PT-D03N050-LTLCardinality-11 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:(OR (LEQ 3 s1) (LEQ s9 s8))], 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 2 reset in 110 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA PGCD-PT-D03N050-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-PT-D03N050-LTLCardinality-11 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:53] [INFO ] Invariant cache hit.
[2023-04-08 08:01:53] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 08:01:53] [INFO ] Invariant cache hit.
[2023-04-08 08:01:53] [INFO ] Implicit Places using invariants in 24 ms returned [9, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57 ms. Remains : 10/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PGCD-PT-D03N050-LTLCardinality-12 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:(OR (LEQ 2 s7) (LEQ s9 s8)), p1:(LEQ 2 s1)], nbAcceptance=2, 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 129 ms.
Stack based approach found an accepted trace after 61534 steps with 0 reset with depth 61535 and stack size 57225 in 86 ms.
FORMULA PGCD-PT-D03N050-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-PT-D03N050-LTLCardinality-12 finished in 324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&X(F(p2)))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:53] [INFO ] Invariant cache hit.
[2023-04-08 08:01:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-04-08 08:01:53] [INFO ] Invariant cache hit.
[2023-04-08 08:01:53] [INFO ] Implicit Places using invariants in 26 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 27 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 8/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : PGCD-PT-D03N050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ 2 s3), p2:(GT 3 s4), p0:(LEQ 2 s7)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PGCD-PT-D03N050-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-PT-D03N050-LTLCardinality-14 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-08 08:01:54] [INFO ] Invariant cache hit.
[2023-04-08 08:01:54] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-04-08 08:01:54] [INFO ] Invariant cache hit.
[2023-04-08 08:01:54] [INFO ] Implicit Places using invariants in 22 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 10/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PGCD-PT-D03N050-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 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT s0 s9), p0:(OR (LEQ s4 s8) (LEQ s0 s9))], 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 24 steps with 0 reset in 0 ms.
FORMULA PGCD-PT-D03N050-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-PT-D03N050-LTLCardinality-15 finished in 199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F((p0&&G(p1)))))))'
[2023-04-08 08:01:54] [INFO ] Flatten gal took : 6 ms
[2023-04-08 08:01:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-08 08:01:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 12 transitions and 56 arcs took 0 ms.
Total runtime 9113 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1046/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PGCD-PT-D03N050-LTLCardinality-09

BK_STOP 1680940915623

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name PGCD-PT-D03N050-LTLCardinality-09
ltl formula formula --ltl=/tmp/1046/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 12 places, 12 transitions and 56 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1046/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1046/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1046/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1046/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PGCD-PT-D03N050"
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 PGCD-PT-D03N050, 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 r521-tall-167987246700459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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