Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372800432.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PGCD-COL-D02N006, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372800432
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.5K Apr 11 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 11 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 15:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 15:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 11 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11K May 18 16:43 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-COL-D02N006-LTLCardinality-00
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-01
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-02
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-03
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-04
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-05
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-06
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-07
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-08
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-09
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-10
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-11
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-12
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-13
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-14
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716695977821

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-COL-D02N006
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-26 03:59:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 03:59:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:59:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 03:59:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 03:59:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 658 ms
[2024-05-26 03:59:40] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 03:59:40] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2024-05-26 03:59:40] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PGCD-COL-D02N006-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 3 rows 3 cols
[2024-05-26 03:59:40] [INFO ] Computed 2 invariants in 8 ms
[2024-05-26 03:59:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 03:59:40] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-26 03:59:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 03:59:40] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
FORMULA PGCD-COL-D02N006-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 03:59:41] [INFO ] Flatten gal took : 17 ms
[2024-05-26 03:59:41] [INFO ] Flatten gal took : 1 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2024-05-26 03:59:41] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 4 ms.
[2024-05-26 03:59:41] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 5 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-26 03:59:41] [INFO ] Computed 4 invariants in 1 ms
[2024-05-26 03:59:41] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-26 03:59:41] [INFO ] Invariant cache hit.
[2024-05-26 03:59:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-26 03:59:41] [INFO ] Invariant cache hit.
[2024-05-26 03:59:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:41] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-26 03:59:41] [INFO ] Invariant cache hit.
[2024-05-26 03:59:41] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2024-05-26 03:59:41] [INFO ] Flatten gal took : 2 ms
[2024-05-26 03:59:41] [INFO ] Flatten gal took : 3 ms
[2024-05-26 03:59:41] [INFO ] Input system was already deterministic with 9 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 03:59:41] [INFO ] Invariant cache hit.
[2024-05-26 03:59:41] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 03:59:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 03:59:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 03:59:41] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 5 simplifications.
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' '!((X(G(p0))&&(F(p1)||X(p2))))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:41] [INFO ] Invariant cache hit.
[2024-05-26 03:59:41] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-26 03:59:41] [INFO ] Invariant cache hit.
[2024-05-26 03:59:41] [INFO ] Implicit Places using invariants in 22 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 6/9 places, 9/9 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 296 ms :[(NOT p0), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PGCD-COL-D02N006-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p1 p0) (AND p0 p2)), acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ (ADD s3 s4 s5) (ADD s0 s1 s2)), p1:(GT (ADD s0 s1 s2) (ADD s3 s4 s5)), p2:(GT 3 (ADD s0 s1 s2))], 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 2 ms.
FORMULA PGCD-COL-D02N006-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-COL-D02N006-LTLCardinality-04 finished in 413 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((p0&&X(p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:42] [INFO ] Invariant cache hit.
[2024-05-26 03:59:42] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-26 03:59:42] [INFO ] Invariant cache hit.
[2024-05-26 03:59:42] [INFO ] Implicit Places using invariants in 21 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 22 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 6/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PGCD-COL-D02N006-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s3 s4 s5)), p1:(GT 1 (ADD s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 285 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA PGCD-COL-D02N006-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N006-LTLCardinality-09 finished in 417 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||X(F(p1)))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 6 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:42] [INFO ] Invariant cache hit.
[2024-05-26 03:59:42] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2024-05-26 03:59:42] [INFO ] Invariant cache hit.
[2024-05-26 03:59:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 03:59:42] [INFO ] Invariant cache hit.
[2024-05-26 03:59:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-26 03:59:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 03:59:42] [INFO ] Invariant cache hit.
[2024-05-26 03:59:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PGCD-COL-D02N006-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT 2 (ADD s3 s4 s5)) (GT (ADD s0 s1 s2) (ADD s3 s4 s5))), p1:(AND (LEQ (ADD s6 s7 s8) (ADD s0 s1 s2)) (GT (ADD s0 s1 s2) (ADD s3 s4 s5)))], 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 2596 reset in 160 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA PGCD-COL-D02N006-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N006-LTLCardinality-10 finished in 378 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(G(p0)) U (p1||G(F(!p2))))))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:42] [INFO ] Invariant cache hit.
[2024-05-26 03:59:42] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-26 03:59:42] [INFO ] Invariant cache hit.
[2024-05-26 03:59:42] [INFO ] Implicit Places using invariants in 24 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 6/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 (NOT p0)), (AND (NOT p1) p2), (AND p2 (NOT p0))]
Running random walk in product with property : PGCD-COL-D02N006-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (LEQ 2 (ADD s0 s1 s2)) (LEQ (ADD s3 s4 s5) (ADD s0 s1 s2))), p2:(GT (ADD s0 s1 s2) (ADD s3 s4 s5)), p0:(LEQ (ADD s3 s4 s5) (ADD s0 s1 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 113 ms.
Product exploration explored 100000 steps with 0 reset in 143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 117 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (AND p2 (NOT p0)), (AND (NOT p1) p2), (AND p2 (NOT p0)), false, false, false, false]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 9 rows 6 cols
[2024-05-26 03:59:44] [INFO ] Computed 1 invariants in 0 ms
[2024-05-26 03:59:44] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2024-05-26 03:59:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 03:59:44] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F p1), (F (AND p0 p1 p2)), (F (AND p0 p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 16 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PGCD-COL-D02N006-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PGCD-COL-D02N006-LTLCardinality-12 finished in 1455 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)||X(F(p1))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-26 03:59:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-26 03:59:44] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-26 03:59:44] [INFO ] Invariant cache hit.
[2024-05-26 03:59:44] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-26 03:59:44] [INFO ] Invariant cache hit.
[2024-05-26 03:59:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:44] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-26 03:59:44] [INFO ] Invariant cache hit.
[2024-05-26 03:59:44] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PGCD-COL-D02N006-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT (ADD s3 s4 s5) (ADD s6 s7 s8)), p0:(GT (ADD s0 s1 s2) (ADD s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PGCD-COL-D02N006-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PGCD-COL-D02N006-LTLCardinality-13 finished in 419 ms.
All properties solved by simple procedures.
Total runtime 5251 ms.

BK_STOP 1716695985777

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PGCD-COL-D02N006"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PGCD-COL-D02N006, 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 r263-tall-171654372800432"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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