fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r087-tall-171620521600147
Last Updated
July 7, 2024

About the Execution of 2023-gold for CSRepetitions-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
436.203 13078.00 22233.00 371.40 TFFFFTFFTTFFFFFF 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.r087-tall-171620521600147.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 CSRepetitions-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521600147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-rw-r--r-- 1 mcc users 26K Apr 12 09:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 09:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 09:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 12 09:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 209K Apr 12 09:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 39K Apr 12 09:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 181K Apr 12 09:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 40K 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 CSRepetitions-PT-03-LTLCardinality-00
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-01
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-02
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-03
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-04
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-05
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-06
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-07
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-08
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-09
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-10
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-11
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-12
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-13
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-14
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716245609287

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=CSRepetitions-PT-03
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 22:53:30] [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-20 22:53:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:53:30] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-20 22:53:30] [INFO ] Transformed 58 places.
[2024-05-20 22:53:30] [INFO ] Transformed 81 transitions.
[2024-05-20 22:53:30] [INFO ] Parsed PT model containing 58 places and 81 transitions and 279 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CSRepetitions-PT-03-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 7 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2024-05-20 22:53:31] [INFO ] Computed 12 invariants in 13 ms
[2024-05-20 22:53:31] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-20 22:53:31] [INFO ] Invariant cache hit.
[2024-05-20 22:53:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:31] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-20 22:53:31] [INFO ] Invariant cache hit.
[2024-05-20 22:53:31] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 842 ms. Remains : 58/58 places, 81/81 transitions.
Support contains 49 out of 58 places after structural reductions.
[2024-05-20 22:53:32] [INFO ] Flatten gal took : 24 ms
[2024-05-20 22:53:32] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:53:32] [INFO ] Input system was already deterministic with 81 transitions.
Incomplete random walk after 10000 steps, including 323 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 29) seen :24
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-20 22:53:32] [INFO ] Invariant cache hit.
[2024-05-20 22:53:32] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 22:53:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-20 22:53:32] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA CSRepetitions-PT-03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 9 stable transitions
FORMULA CSRepetitions-PT-03-LTLCardinality-10 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' '!(X((G(p0)||X((p1||F(p2))))))'
Support contains 49 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:33] [INFO ] Invariant cache hit.
[2024-05-20 22:53:33] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-20 22:53:33] [INFO ] Invariant cache hit.
[2024-05-20 22:53:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:33] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-20 22:53:33] [INFO ] Invariant cache hit.
[2024-05-20 22:53:33] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 58/58 places, 81/81 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 371 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(LEQ (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49) (ADD s33 s50 s56)), p1:(LEQ (ADD s1 s3 s4 s6 s9 s11 s12 s14 s18 s19 s20 s22 s24 s27 s28 s29 s30 s32 s34 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 277 ms.
Product exploration explored 100000 steps with 33333 reset in 194 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-03-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-03-LTLCardinality-00 finished in 1055 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(p1)))'
Support contains 40 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:34] [INFO ] Invariant cache hit.
[2024-05-20 22:53:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-20 22:53:34] [INFO ] Invariant cache hit.
[2024-05-20 22:53:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:34] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-20 22:53:34] [INFO ] Invariant cache hit.
[2024-05-20 22:53:34] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (GT (ADD s1 s3 s4 s6 s9 s11 s12 s14 s18 s19 s20 s22 s24 s27 s28 s29 s30 s32 s34 s35 s39 s42 s45 s46 s51 s52 s57) (ADD s7 s15 s23 s26 s36 s40 s53 s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-02 finished in 328 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)||G(p1))) U G(p2))))'
Support contains 46 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:34] [INFO ] Invariant cache hit.
[2024-05-20 22:53:34] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-20 22:53:34] [INFO ] Invariant cache hit.
[2024-05-20 22:53:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:34] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-20 22:53:34] [INFO ] Invariant cache hit.
[2024-05-20 22:53:34] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={1} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(GT 2 (ADD s1 s3 s4 s6 s9 s11 s12 s14 s18 s19 s20 s22 s24 s27 s28 s29 s30 s32 s34 s35 s39 s42 s45 s46 s51 s52 s57)), p0:(LEQ s48 (ADD s1 s3 s4 s6 s9 s1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2841 reset in 527 ms.
Stack based approach found an accepted trace after 21786 steps with 618 reset with depth 15 and stack size 15 in 130 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-03 finished in 931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 18 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:35] [INFO ] Invariant cache hit.
[2024-05-20 22:53:35] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-20 22:53:35] [INFO ] Invariant cache hit.
[2024-05-20 22:53:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:35] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-20 22:53:35] [INFO ] Invariant cache hit.
[2024-05-20 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49) (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-04 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U (p1 U (!F(X(p2))||p3))))'
Support contains 10 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:35] [INFO ] Invariant cache hit.
[2024-05-20 22:53:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-20 22:53:35] [INFO ] Invariant cache hit.
[2024-05-20 22:53:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:35] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-20 22:53:35] [INFO ] Invariant cache hit.
[2024-05-20 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) p3), true, (NOT p2), p3, (AND p0 p3)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND p3 p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p0 p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 2 (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49)), p1:(LEQ 1 (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49)), p2:(LEQ 3 s48), p0:(AND (LEQ 1 (ADD s0 s5 s10 s13 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 (NOT p0)), (X (NOT p3)), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND (NOT p3) p0 p2))), (X (AND (NOT p3) p2)), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p3) p0))), (X p2), (X (AND p1 (NOT p3))), true, (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 19 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-03-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-03-LTLCardinality-05 finished in 752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||(p1&&(p2 U (p3||G(p2))))))))'
Support contains 49 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:36] [INFO ] Invariant cache hit.
[2024-05-20 22:53:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-20 22:53:36] [INFO ] Invariant cache hit.
[2024-05-20 22:53:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:36] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-20 22:53:36] [INFO ] Invariant cache hit.
[2024-05-20 22:53:36] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(GT (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49) (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55)), p1:(GT (ADD s33 s50 s56) (ADD s1 s3 s4 s6 s9 s11 s12 s14 s18 s19...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 11258 reset in 232 ms.
Stack based approach found an accepted trace after 3729 steps with 411 reset with depth 11 and stack size 11 in 9 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-06 finished in 621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((p0 U (p1||G(p0))))))))'
Support contains 21 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:37] [INFO ] Invariant cache hit.
[2024-05-20 22:53:37] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-20 22:53:37] [INFO ] Invariant cache hit.
[2024-05-20 22:53:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:37] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-20 22:53:37] [INFO ] Invariant cache hit.
[2024-05-20 22:53:37] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND p0 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55) (ADD s33 s50 s56)), p1:(AND (NOT (AND (LEQ (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55) (ADD s33 s50 s56)) (LE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-07 finished in 282 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(X(F(!p1)))))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:37] [INFO ] Invariant cache hit.
[2024-05-20 22:53:37] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-20 22:53:37] [INFO ] Invariant cache hit.
[2024-05-20 22:53:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:37] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-20 22:53:37] [INFO ] Invariant cache hit.
[2024-05-20 22:53:37] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s10 s48), p1:(LEQ 3 s48)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 18318 reset in 129 ms.
Product exploration explored 100000 steps with 18335 reset in 130 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[p1, p1, p1]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 104 ms :[p1, p1, p1]
[2024-05-20 22:53:38] [INFO ] Invariant cache hit.
[2024-05-20 22:53:38] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2024-05-20 22:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:53:38] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-20 22:53:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:38] [INFO ] [Real]Added 9 Read/Feed constraints in 3 ms returned sat
[2024-05-20 22:53:38] [INFO ] Computed and/alt/rep : 72/99/72 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-20 22:53:38] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG p1
Support contains 1 out of 58 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:38] [INFO ] Invariant cache hit.
[2024-05-20 22:53:38] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-20 22:53:38] [INFO ] Invariant cache hit.
[2024-05-20 22:53:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:38] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-20 22:53:38] [INFO ] Invariant cache hit.
[2024-05-20 22:53:38] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 58/58 places, 81/81 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[p1, p1, p1]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 118 ms :[p1, p1, p1]
[2024-05-20 22:53:39] [INFO ] Invariant cache hit.
[2024-05-20 22:53:39] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2024-05-20 22:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:53:39] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-20 22:53:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:39] [INFO ] [Real]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-20 22:53:39] [INFO ] Computed and/alt/rep : 72/99/72 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-20 22:53:39] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 96 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 18279 reset in 127 ms.
Product exploration explored 100000 steps with 18276 reset in 127 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[p1, p1, p1]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 11 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:53:40] [INFO ] Invariant cache hit.
[2024-05-20 22:53:40] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 58/58 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin18445488255293729023
[2024-05-20 22:53:40] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18445488255293729023
Running compilation step : cd /tmp/ltsmin18445488255293729023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 228 ms.
Running link step : cd /tmp/ltsmin18445488255293729023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18445488255293729023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10143852533542708430.hoa' '--buchi-type=spotba'
LTSmin run took 244 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-PT-03-LTLCardinality-08 finished in 3365 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(G(p1)))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 44 transition count 74
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 39 place count 26 transition count 56
Iterating global reduction 0 with 18 rules applied. Total rules applied 57 place count 26 transition count 56
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 62 place count 21 transition count 36
Iterating global reduction 0 with 5 rules applied. Total rules applied 67 place count 21 transition count 36
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 72 place count 21 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 19 transition count 29
Applied a total of 76 rules in 20 ms. Remains 19 /58 variables (removed 39) and now considering 29/81 (removed 52) transitions.
[2024-05-20 22:53:40] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
// Phase 1: matrix 27 rows 19 cols
[2024-05-20 22:53:40] [INFO ] Computed 5 invariants in 1 ms
[2024-05-20 22:53:40] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-20 22:53:40] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2024-05-20 22:53:40] [INFO ] Invariant cache hit.
[2024-05-20 22:53:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-20 22:53:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-20 22:53:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:53:40] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2024-05-20 22:53:40] [INFO ] Invariant cache hit.
[2024-05-20 22:53:40] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/58 places, 29/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 19/58 places, 29/81 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-13 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s16 s17), p1:(LEQ 1 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-13 finished in 242 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 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 40 transition count 72
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 51 place count 16 transition count 48
Iterating global reduction 0 with 24 rules applied. Total rules applied 75 place count 16 transition count 48
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 82 place count 9 transition count 20
Iterating global reduction 0 with 7 rules applied. Total rules applied 89 place count 9 transition count 20
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 96 place count 9 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 105 place count 3 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 109 place count 3 transition count 6
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 2 transition count 4
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 2 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 2 transition count 3
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 2 transition count 3
Applied a total of 113 rules in 12 ms. Remains 2 /58 variables (removed 56) and now considering 3/81 (removed 78) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-20 22:53:40] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 22:53:40] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-20 22:53:40] [INFO ] Invariant cache hit.
[2024-05-20 22:53:41] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-20 22:53:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 22:53:41] [INFO ] Invariant cache hit.
[2024-05-20 22:53:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/58 places, 3/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 2/58 places, 3/81 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s1)], 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 10071 reset in 111 ms.
Stack based approach found an accepted trace after 9 steps with 1 reset with depth 2 and stack size 2 in 0 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-15 finished in 241 ms.
All properties solved by simple procedures.
Total runtime 10502 ms.

BK_STOP 1716245622365

--------------------
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="CSRepetitions-PT-03"
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 CSRepetitions-PT-03, 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 r087-tall-171620521600147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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