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.r175-smll-171636280000157.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 Eratosthenes-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280000157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 19:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 12 19:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 19:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 12 19:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 126K May 18 16:42 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 Eratosthenes-PT-100-LTLCardinality-00
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-01
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-02
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-03
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-04
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-05
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-06
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-07
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-08
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-09
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-10
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-11
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-12
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-13
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-14
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716581725394

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=Eratosthenes-PT-100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 20:15:27] [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-24 20:15:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 20:15:28] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-24 20:15:28] [INFO ] Transformed 99 places.
[2024-05-24 20:15:28] [INFO ] Transformed 283 transitions.
[2024-05-24 20:15:28] [INFO ] Parsed PT model containing 99 places and 283 transitions and 849 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
FORMULA Eratosthenes-PT-100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 211/211 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 67 transition count 204
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 67 transition count 204
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 0 with 137 rules applied. Total rules applied 151 place count 67 transition count 67
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 196 place count 22 transition count 22
Iterating global reduction 0 with 45 rules applied. Total rules applied 241 place count 22 transition count 22
Applied a total of 241 rules in 27 ms. Remains 22 /74 variables (removed 52) and now considering 22/211 (removed 189) transitions.
// Phase 1: matrix 22 rows 22 cols
[2024-05-24 20:15:28] [INFO ] Computed 0 invariants in 3 ms
[2024-05-24 20:15:28] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-24 20:15:28] [INFO ] Invariant cache hit.
[2024-05-24 20:15:28] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-05-24 20:15:28] [INFO ] Invariant cache hit.
[2024-05-24 20:15:28] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/74 places, 22/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 22/74 places, 22/211 transitions.
Support contains 21 out of 22 places after structural reductions.
[2024-05-24 20:15:28] [INFO ] Flatten gal took : 19 ms
[2024-05-24 20:15:28] [INFO ] Flatten gal took : 5 ms
[2024-05-24 20:15:28] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10014 steps, including 131 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 23) seen :14
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-24 20:15:29] [INFO ] Invariant cache hit.
[2024-05-24 20:15:29] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-24 20:15:29] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Eratosthenes-PT-100-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
FORMULA Eratosthenes-PT-100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Eratosthenes-PT-100-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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||G(p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Graph (complete) has 0 edges and 22 vertex of which 2 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Applied a total of 1 rules in 4 ms. Remains 2 /22 variables (removed 20) and now considering 2/22 (removed 20) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 20:15:30] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:30] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 20:15:30] [INFO ] Invariant cache hit.
[2024-05-24 20:15:30] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 20:15:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:15:30] [INFO ] Invariant cache hit.
[2024-05-24 20:15:30] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 2/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 2/22 places, 2/22 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 248 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(GT 1 s0), p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Eratosthenes-PT-100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLCardinality-03 finished in 393 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 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Graph (complete) has 0 edges and 22 vertex of which 1 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /22 variables (removed 21) and now considering 1/22 (removed 21) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-24 20:15:30] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:30] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 20:15:30] [INFO ] Invariant cache hit.
[2024-05-24 20:15:30] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-24 20:15:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:15:30] [INFO ] Invariant cache hit.
[2024-05-24 20:15:30] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/22 places, 1/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 1/22 places, 1/22 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-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:(GT 1 s0)], 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 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-100-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLCardinality-08 finished in 596 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)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Graph (complete) has 0 edges and 22 vertex of which 1 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /22 variables (removed 21) and now considering 1/22 (removed 21) transitions.
[2024-05-24 20:15:31] [INFO ] Invariant cache hit.
[2024-05-24 20:15:31] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 20:15:31] [INFO ] Invariant cache hit.
[2024-05-24 20:15:31] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-24 20:15:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:15:31] [INFO ] Invariant cache hit.
[2024-05-24 20:15:31] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/22 places, 1/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 1/22 places, 1/22 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s0)], 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 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLCardinality-09 finished in 121 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 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Graph (complete) has 0 edges and 22 vertex of which 3 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Applied a total of 1 rules in 0 ms. Remains 3 /22 variables (removed 19) and now considering 3/22 (removed 19) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:15:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 20:15:31] [INFO ] Invariant cache hit.
[2024-05-24 20:15:31] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-24 20:15:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:15:31] [INFO ] Invariant cache hit.
[2024-05-24 20:15:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/22 places, 3/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 3/22 places, 3/22 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-100-LTLCardinality-10 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 1 s2), p1:(OR (GT s1 s2) (GT 1 s0))], 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 25000 reset in 213 ms.
Product exploration explored 100000 steps with 25000 reset in 351 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-100-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLCardinality-10 finished in 733 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)||(p1 U (p2||G(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Graph (complete) has 0 edges and 22 vertex of which 3 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /22 variables (removed 19) and now considering 3/22 (removed 19) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:15:31] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 20:15:31] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 20:15:31] [INFO ] Invariant cache hit.
[2024-05-24 20:15:31] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-24 20:15:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:15:31] [INFO ] Invariant cache hit.
[2024-05-24 20:15:31] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/22 places, 3/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 3/22 places, 3/22 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (GT 1 s1) (GT 1 s2)), p2:(AND (GT 1 s2) (LEQ 1 s0)), p1:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 42855 reset in 173 ms.
Product exploration explored 100000 steps with 42826 reset in 102 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-100-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLCardinality-13 finished in 494 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)&&F((p1&&X(G((p1||G(!p1)))))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Graph (complete) has 0 edges and 22 vertex of which 3 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Applied a total of 1 rules in 0 ms. Remains 3 /22 variables (removed 19) and now considering 3/22 (removed 19) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:15:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:32] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 20:15:32] [INFO ] Invariant cache hit.
[2024-05-24 20:15:32] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 20:15:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:15:32] [INFO ] Invariant cache hit.
[2024-05-24 20:15:32] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/22 places, 3/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 3/22 places, 3/22 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false]
Running random walk in product with property : Eratosthenes-PT-100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={1} source=3 dest: 4}], [{ cond=p1, acceptance={0, 1} source=4 dest: 3}, { cond=(NOT p1), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s2), p1:(LEQ s0 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 8 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLCardinality-14 finished in 302 ms.
All properties solved by simple procedures.
Total runtime 4908 ms.

BK_STOP 1716581733982

--------------------
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="Eratosthenes-PT-100"
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 Eratosthenes-PT-100, 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 r175-smll-171636280000157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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