fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r175-smll-171636280000162
Last Updated
July 7, 2024

About the Execution of 2023-gold for Eratosthenes-PT-200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
302.100 8120.00 14475.00 441.70 FFTFFTFTTFTFTTFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 19:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Apr 12 19:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 19:02 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 311K 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-200-LTLCardinality-00
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-01
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-02
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-03
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-04
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-05
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-06
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-07
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-08
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-09
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-10
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-11
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-12
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-13
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-14
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716581811233

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-200
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 20:16:53] [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:16:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 20:16:53] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-05-24 20:16:53] [INFO ] Transformed 199 places.
[2024-05-24 20:16:53] [INFO ] Transformed 699 transitions.
[2024-05-24 20:16:53] [INFO ] Parsed PT model containing 199 places and 699 transitions and 2097 arcs in 265 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 46 places and 0 transitions.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Eratosthenes-PT-200-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 529/529 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 132 transition count 508
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 132 transition count 508
Drop transitions removed 376 transitions
Redundant transition composition rules discarded 376 transitions
Iterating global reduction 0 with 376 rules applied. Total rules applied 418 place count 132 transition count 132
Discarding 103 places :
Symmetric choice reduction at 0 with 103 rule applications. Total rules 521 place count 29 transition count 29
Iterating global reduction 0 with 103 rules applied. Total rules applied 624 place count 29 transition count 29
Applied a total of 624 rules in 41 ms. Remains 29 /153 variables (removed 124) and now considering 29/529 (removed 500) transitions.
// Phase 1: matrix 29 rows 29 cols
[2024-05-24 20:16:54] [INFO ] Computed 0 invariants in 4 ms
[2024-05-24 20:16:54] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-24 20:16:54] [INFO ] Invariant cache hit.
[2024-05-24 20:16:54] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-24 20:16:54] [INFO ] Invariant cache hit.
[2024-05-24 20:16:54] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/153 places, 29/529 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 29/153 places, 29/529 transitions.
Support contains 28 out of 29 places after structural reductions.
[2024-05-24 20:16:54] [INFO ] Flatten gal took : 21 ms
[2024-05-24 20:16:54] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:16:54] [INFO ] Input system was already deterministic with 29 transitions.
Incomplete random walk after 10046 steps, including 64 resets, run finished after 182 ms. (steps per millisecond=55 ) properties (out of 20) seen :12
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-24 20:16:55] [INFO ] Invariant cache hit.
[2024-05-24 20:16:55] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 20:16:55] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 2 ms.
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Eratosthenes-PT-200-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 29 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29 transition count 29
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-200-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-14 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' '!((F(!(X((p0 U p1)) U G(p0)))||F(G(p2))))'
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 7 transition count 7
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 7 transition count 7
Applied a total of 44 rules in 2 ms. Remains 7 /29 variables (removed 22) and now considering 7/29 (removed 22) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-24 20:16:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:16:56] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 20:16:56] [INFO ] Invariant cache hit.
[2024-05-24 20:16:56] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-24 20:16:56] [INFO ] Invariant cache hit.
[2024-05-24 20:16:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/29 places, 7/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 7/29 places, 7/29 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 315 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2) p1)]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1 s6), p2:(GT s5 s4), p1:(LEQ s3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 5 ms.
FORMULA Eratosthenes-PT-200-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLCardinality-00 finished in 480 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&&F(p1)&&(G(p2)||X(X(F(!p1)))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5 transition count 5
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5 transition count 5
Applied a total of 48 rules in 1 ms. Remains 5 /29 variables (removed 24) and now considering 5/29 (removed 24) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-24 20:16:56] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 20:16:56] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 20:16:56] [INFO ] Invariant cache hit.
[2024-05-24 20:16:56] [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:16:56] [INFO ] Invariant cache hit.
[2024-05-24 20:16:56] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/29 places, 5/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 5/29 places, 5/29 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s2 s3), p1:(LEQ 1 s4), p2:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21193 reset in 264 ms.
Product exploration explored 100000 steps with 21285 reset in 220 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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 p1 (NOT p2)), (F (G p0)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (NOT p2)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p2))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-200-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLCardinality-08 finished in 922 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 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 3 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Applied a total of 1 rules in 4 ms. Remains 3 /29 variables (removed 26) and now considering 3/29 (removed 26) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:16:57] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:16:57] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 20:16:57] [INFO ] Invariant cache hit.
[2024-05-24 20:16:57] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-24 20:16:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:16:57] [INFO ] Invariant cache hit.
[2024-05-24 20:16:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/29 places, 3/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 3/29 places, 3/29 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s1 s2) (LEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25000 reset in 195 ms.
Product exploration explored 100000 steps with 25000 reset in 158 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 : [p0, (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-200-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLCardinality-12 finished in 516 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))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 2 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /29 variables (removed 27) and now considering 2/29 (removed 27) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 20:16:57] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:16:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 20:16:58] [INFO ] Invariant cache hit.
[2024-05-24 20:16:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-24 20:16:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:16:58] [INFO ] Invariant cache hit.
[2024-05-24 20:16:58] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/29 places, 2/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 2/29 places, 2/29 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLCardinality-15 finished in 118 ms.
All properties solved by simple procedures.
Total runtime 4425 ms.

BK_STOP 1716581819353

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

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