Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r069-smll-167814395900059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r069-smll-167814395900059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 21K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 231K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 54K Feb 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 249K Feb 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 40K Mar 5 18:22 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 1678241484633

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=itstools
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 202303021504
[2023-03-08 02:11:28] [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]
[2023-03-08 02:11:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 02:11:28] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-08 02:11:28] [INFO ] Transformed 58 places.
[2023-03-08 02:11:28] [INFO ] Transformed 81 transitions.
[2023-03-08 02:11:28] [INFO ] Parsed PT model containing 58 places and 81 transitions and 279 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
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 17 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2023-03-08 02:11:28] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-08 02:11:28] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-08 02:11:28] [INFO ] Invariant cache hit.
[2023-03-08 02:11:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:28] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-08 02:11:28] [INFO ] Invariant cache hit.
[2023-03-08 02:11:29] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 605 ms. Remains : 58/58 places, 81/81 transitions.
Support contains 49 out of 58 places after structural reductions.
[2023-03-08 02:11:29] [INFO ] Flatten gal took : 58 ms
[2023-03-08 02:11:29] [INFO ] Flatten gal took : 26 ms
[2023-03-08 02:11:29] [INFO ] Input system was already deterministic with 81 transitions.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 634 ms. (steps per millisecond=15 ) properties (out of 29) seen :25
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 02:11:30] [INFO ] Invariant cache hit.
[2023-03-08 02:11:30] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-08 02:11:30] [INFO ] After 100ms SMT Verify possible using all constraints in real 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 16 simplifications.
FORMULA CSRepetitions-PT-03-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 9 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||((!p1&&X(p2)) U (G((!p1&&X(p2)))||(X(p2)&&p3))))))'
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 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:11:31] [INFO ] Invariant cache hit.
[2023-03-08 02:11:31] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 02:11:31] [INFO ] Invariant cache hit.
[2023-03-08 02:11:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:31] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-08 02:11:31] [INFO ] Invariant cache hit.
[2023-03-08 02:11:31] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 438 ms :[true, (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND p1 (NOT p3))), (OR (NOT p2) (AND (NOT p0) p1 (NOT p3)))]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p3) p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p3 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3) p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 2 (ADD s33 s50 s56)), p3:(AND (GT 3 (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49)) (NOT (AND (LEQ s48 (ADD s1 s3 s4 s6 s9 s11 s12 s14 s18 s19 s20 s22 s2...], 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 13 steps with 0 reset in 4 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-00 finished in 854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 9 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 4 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:11:31] [INFO ] Invariant cache hit.
[2023-03-08 02:11:31] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-08 02:11:31] [INFO ] Invariant cache hit.
[2023-03-08 02:11:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:32] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-08 02:11:32] [INFO ] Invariant cache hit.
[2023-03-08 02:11:32] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 2 (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 31520 reset in 474 ms.
Stack based approach found an accepted trace after 21289 steps with 6724 reset with depth 6 and stack size 6 in 75 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-01 finished in 1063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 27 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
Applied a total of 27 rules in 18 ms. Remains 40 /58 variables (removed 18) and now considering 72/81 (removed 9) transitions.
// Phase 1: matrix 72 rows 40 cols
[2023-03-08 02:11:32] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-08 02:11:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 02:11:32] [INFO ] Invariant cache hit.
[2023-03-08 02:11:33] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-08 02:11:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:11:33] [INFO ] Invariant cache hit.
[2023-03-08 02:11:33] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/58 places, 72/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 40/58 places, 72/81 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s2 s3 s4 s6 s7 s8 s9 s11 s12 s13 s15 s16 s18 s19 s20 s21 s22 s24 s25 s27 s29 s31 s32 s36 s37 s39))], 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 6 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 388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&(p1 U p2)))))'
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.
// Phase 1: matrix 81 rows 58 cols
[2023-03-08 02:11:33] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-08 02:11:33] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 02:11:33] [INFO ] Invariant cache hit.
[2023-03-08 02:11:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:33] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-08 02:11:33] [INFO ] Invariant cache hit.
[2023-03-08 02:11:33] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(LEQ (ADD s33 s50 s56) (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55)), p1:(GT 2 (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55)), p0:(OR (LEQ (ADD s1 s3 s4 s6 s9 s...], 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 33333 reset in 329 ms.
Product exploration explored 100000 steps with 33333 reset in 263 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 (NOT p1) p0), (X (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 (NOT p2) p1))))
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-03-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-03-LTLCardinality-03 finished in 1240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((!p1||F(p0)))))))'
Support contains 28 out of 58 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:11:34] [INFO ] Invariant cache hit.
[2023-03-08 02:11:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 02:11:34] [INFO ] Invariant cache hit.
[2023-03-08 02:11:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:34] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-08 02:11:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:11:34] [INFO ] Invariant cache hit.
[2023-03-08 02:11:34] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-04 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:(LEQ s48 (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))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8721 reset in 247 ms.
Stack based approach found an accepted trace after 116 steps with 10 reset with depth 7 and stack size 7 in 0 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-04 finished in 636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (p1||F(p2))))'
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.
[2023-03-08 02:11:35] [INFO ] Invariant cache hit.
[2023-03-08 02:11:35] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 02:11:35] [INFO ] Invariant cache hit.
[2023-03-08 02:11:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:35] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-08 02:11:35] [INFO ] Invariant cache hit.
[2023-03-08 02:11:35] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55)), p2:(GT 3 (ADD s33 s50 s56)), p0:(AND (LEQ 2 (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55)) (LEQ s48 (ADD s1...], nbAcceptance=1, 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]]
Stuttering criterion allowed to conclude after 781 steps with 88 reset in 3 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-05 finished in 441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 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
Applied a total of 96 rules in 15 ms. Remains 9 /58 variables (removed 49) and now considering 13/81 (removed 68) transitions.
// Phase 1: matrix 13 rows 9 cols
[2023-03-08 02:11:35] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 02:11:35] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-08 02:11:35] [INFO ] Invariant cache hit.
[2023-03-08 02:11:35] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-08 02:11:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:11:35] [INFO ] Invariant cache hit.
[2023-03-08 02:11:35] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/58 places, 13/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 9/58 places, 13/81 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-06 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 s6 (ADD s4 s7 s8))], 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 3956 reset in 195 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-06 finished in 351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 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 7 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2023-03-08 02:11:35] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-08 02:11:36] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 02:11:36] [INFO ] Invariant cache hit.
[2023-03-08 02:11:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:36] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-08 02:11:36] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 02:11:36] [INFO ] Invariant cache hit.
[2023-03-08 02:11:36] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55) s48)], 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 35 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 372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U G(p1))))'
Support contains 3 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.
[2023-03-08 02:11:36] [INFO ] Invariant cache hit.
[2023-03-08 02:11:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 02:11:36] [INFO ] Invariant cache hit.
[2023-03-08 02:11:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:36] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-08 02:11:36] [INFO ] Invariant cache hit.
[2023-03-08 02:11:36] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s48 s31), p0:(LEQ 1 s50)], 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 55 steps with 1 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-08 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 42 transition count 73
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 44 place count 22 transition count 53
Iterating global reduction 0 with 20 rules applied. Total rules applied 64 place count 22 transition count 53
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 17 transition count 33
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 17 transition count 33
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 79 place count 17 transition count 28
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 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 14 transition count 25
Applied a total of 85 rules in 17 ms. Remains 14 /58 variables (removed 44) and now considering 25/81 (removed 56) transitions.
[2023-03-08 02:11:36] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 14 cols
[2023-03-08 02:11:36] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 02:11:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 02:11:36] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2023-03-08 02:11:36] [INFO ] Invariant cache hit.
[2023-03-08 02:11:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 02:11:36] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-08 02:11:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 02:11:36] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2023-03-08 02:11:36] [INFO ] Invariant cache hit.
[2023-03-08 02:11:36] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/58 places, 25/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 14/58 places, 25/81 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-09 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 s12 s10), p1:(LEQ s1 s10)], 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 22 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-09 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(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 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 42 transition count 73
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 45 place count 21 transition count 52
Iterating global reduction 0 with 21 rules applied. Total rules applied 66 place count 21 transition count 52
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 15 transition count 28
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 15 transition count 28
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 15 transition count 22
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 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 12 transition count 19
Applied a total of 90 rules in 15 ms. Remains 12 /58 variables (removed 46) and now considering 19/81 (removed 62) transitions.
[2023-03-08 02:11:37] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 12 cols
[2023-03-08 02:11:37] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 02:11:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 02:11:37] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-08 02:11:37] [INFO ] Invariant cache hit.
[2023-03-08 02:11:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 02:11:37] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-08 02:11:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:11:37] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-08 02:11:37] [INFO ] Invariant cache hit.
[2023-03-08 02:11:37] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/58 places, 19/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 12/58 places, 19/81 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-10 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 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 34 steps with 2 reset in 1 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-10 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 5 transition count 11
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 5 transition count 9
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 4 transition count 6
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 4 transition count 5
Applied a total of 107 rules in 18 ms. Remains 4 /58 variables (removed 54) and now considering 5/81 (removed 76) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-08 02:11:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 02:11:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-08 02:11:37] [INFO ] Invariant cache hit.
[2023-03-08 02:11:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-08 02:11:37] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-08 02:11:37] [INFO ] Invariant cache hit.
[2023-03-08 02:11:37] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/58 places, 5/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 4/58 places, 5/81 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2 s3)], 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]]
Product exploration explored 100000 steps with 16848 reset in 162 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-11 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 42 transition count 73
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 44 place count 22 transition count 53
Iterating global reduction 0 with 20 rules applied. Total rules applied 64 place count 22 transition count 53
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 17 transition count 33
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 17 transition count 33
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 79 place count 17 transition count 28
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 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 14 transition count 25
Applied a total of 85 rules in 13 ms. Remains 14 /58 variables (removed 44) and now considering 25/81 (removed 56) transitions.
[2023-03-08 02:11:37] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 14 cols
[2023-03-08 02:11:37] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 02:11:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 02:11:37] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2023-03-08 02:11:37] [INFO ] Invariant cache hit.
[2023-03-08 02:11:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 02:11:37] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-08 02:11:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:11:37] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2023-03-08 02:11:37] [INFO ] Invariant cache hit.
[2023-03-08 02:11:37] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/58 places, 25/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 14/58 places, 25/81 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s3 s9)], 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]]
Product exploration explored 100000 steps with 19816 reset in 238 ms.
Stack based approach found an accepted trace after 11 steps with 2 reset with depth 7 and stack size 7 in 1 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-12 finished in 438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||G(!p0)))))))'
Support contains 1 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.
// Phase 1: matrix 81 rows 58 cols
[2023-03-08 02:11:38] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-08 02:11:38] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 02:11:38] [INFO ] Invariant cache hit.
[2023-03-08 02:11:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:38] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-08 02:11:38] [INFO ] Invariant cache hit.
[2023-03-08 02:11:38] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 267 ms :[true, p0, false, false, false, false]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(LEQ 1 s52)], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 305 steps with 9 reset in 1 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLCardinality-14 finished in 617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(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 8 ms. Remains 2 /58 variables (removed 56) and now considering 3/81 (removed 78) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-08 02:11:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 02:11:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 02:11:38] [INFO ] Invariant cache hit.
[2023-03-08 02:11:38] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-08 02:11:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:11:38] [INFO ] Invariant cache hit.
[2023-03-08 02:11:38] [INFO ] Dead Transitions using invariants and state equation in 24 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 82 ms. Remains : 2/58 places, 3/81 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLCardinality-15 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 3 s1)], 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 18017 reset in 64 ms.
Product exploration explored 100000 steps with 18097 reset in 66 ms.
Computed a total of 0 stabilizing places and 1 stable transitions
Computed a total of 0 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 214 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
[2023-03-08 02:11:39] [INFO ] Invariant cache hit.
[2023-03-08 02:11:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:11:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-08 02:11:39] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 02:11:39] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-08 02:11:39] [INFO ] Invariant cache hit.
[2023-03-08 02:11:39] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-08 02:11:39] [INFO ] Invariant cache hit.
[2023-03-08 02:11:39] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-08 02:11:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:11:39] [INFO ] Invariant cache hit.
[2023-03-08 02:11:39] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 2/2 places, 3/3 transitions.
Computed a total of 0 stabilizing places and 1 stable transitions
Computed a total of 0 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
[2023-03-08 02:11:40] [INFO ] Invariant cache hit.
[2023-03-08 02:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:11:40] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-08 02:11:40] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 02:11:40] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18215 reset in 105 ms.
Product exploration explored 100000 steps with 17976 reset in 105 ms.
Built C files in :
/tmp/ltsmin186749436210098556
[2023-03-08 02:11:41] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2023-03-08 02:11:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 02:11:41] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2023-03-08 02:11:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 02:11:41] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2023-03-08 02:11:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 02:11:41] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin186749436210098556
Running compilation step : cd /tmp/ltsmin186749436210098556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin186749436210098556;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin186749436210098556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1791926810492090395.hoa' '--buchi-type=spotba'
LTSmin run took 103 ms.
FORMULA CSRepetitions-PT-03-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-PT-03-LTLCardinality-15 finished in 2804 ms.
All properties solved by simple procedures.
Total runtime 13403 ms.

BK_STOP 1678241502435

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r069-smll-167814395900059"
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 ;