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.r457-smll-167912648800035.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 ltsminxred
Input is SmallOperatingSystem-PT-MT0064DC0032, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912648800035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 12:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 220K Feb 25 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 12:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.2K Mar 5 18:23 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 SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679213961115

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmallOperatingSystem-PT-MT0064DC0032
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 08:19:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 08:19:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 08:19:23] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-19 08:19:23] [INFO ] Transformed 9 places.
[2023-03-19 08:19:23] [INFO ] Transformed 8 transitions.
[2023-03-19 08:19:23] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 12 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 08:19:24] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 08:19:24] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-19 08:19:24] [INFO ] Invariant cache hit.
[2023-03-19 08:19:24] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-19 08:19:24] [INFO ] Invariant cache hit.
[2023-03-19 08:19:24] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 08:19:24] [INFO ] Flatten gal took : 17 ms
[2023-03-19 08:19:24] [INFO ] Flatten gal took : 6 ms
[2023-03-19 08:19:24] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10031 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 08:19:25] [INFO ] Invariant cache hit.
[2023-03-19 08:19:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 08:19:25] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-19 08:19:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-19 08:19:25] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(X(F(p0))))))||F(p1)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-19 08:19:26] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 08:19:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 08:19:26] [INFO ] Invariant cache hit.
[2023-03-19 08:19:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-19 08:19:26] [INFO ] Invariant cache hit.
[2023-03-19 08:19:26] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(LEQ 1 s7), p0:(LEQ s5 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-01 finished in 1167 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((G(F(p0))&&F(p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 08:19:27] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 08:19:27] [INFO ] Implicit Places using invariants in 38 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 2 s6), p1:(GT s0 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 253 ms.
Stack based approach found an accepted trace after 163 steps with 4 reset with depth 31 and stack size 22 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-02 finished in 561 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)))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-19 08:19:27] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 08:19:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 08:19:27] [INFO ] Invariant cache hit.
[2023-03-19 08:19:27] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-19 08:19:27] [INFO ] Invariant cache hit.
[2023-03-19 08:19:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GT 3 s2) (GT 2 s5))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-03 finished in 272 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)||G((F(!p0)&&F(p1))))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 5 transition count 7
Applied a total of 5 rules in 14 ms. Remains 5 /9 variables (removed 4) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 5 cols
[2023-03-19 08:19:27] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 08:19:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 08:19:28] [INFO ] Invariant cache hit.
[2023-03-19 08:19:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:19:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-19 08:19:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:19:28] [INFO ] Invariant cache hit.
[2023-03-19 08:19:28] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/9 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 5/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s4), p1:(LEQ 3 s1)], 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 0 reset in 213 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 321 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 429 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=214 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 08:19:29] [INFO ] Invariant cache hit.
[2023-03-19 08:19:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 08:19:29] [INFO ] Invariant cache hit.
[2023-03-19 08:19:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:19:29] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-19 08:19:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:19:29] [INFO ] Invariant cache hit.
[2023-03-19 08:19:29] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 5/5 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 165 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Product exploration explored 100000 steps with 0 reset in 108 ms.
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 08:19:30] [INFO ] Invariant cache hit.
[2023-03-19 08:19:30] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 08:19:30] [INFO ] Invariant cache hit.
[2023-03-19 08:19:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:19:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-19 08:19:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:19:30] [INFO ] Invariant cache hit.
[2023-03-19 08:19:30] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 5/5 places, 7/7 transitions.
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-04 finished in 2688 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) U (p1&&X(X(X(p2))))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 08:19:30] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 08:19:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 08:19:30] [INFO ] Invariant cache hit.
[2023-03-19 08:19:30] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-19 08:19:30] [INFO ] Invariant cache hit.
[2023-03-19 08:19:30] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 9/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 746 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (AND p1 (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=p1, acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(NOT p1), acceptance={} source=5 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 10}, { cond=p1, acceptance={} source=5 dest: 11}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 12}, { cond=(NOT p1), acceptance={} source=7 dest: 13}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 14}, { cond=p1, acceptance={} source=7 dest: 15}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=10 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=11 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=13 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=13 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={} source=13 dest: 11}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=14 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=15 dest: 12}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=15 dest: 13}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=15 dest: 14}, { cond=(AND p1 (NOT p2)), acceptance={} source=15 dest: 15}]], initial=0, aps=[p1:(LEQ s2 s8), p0:(LEQ 3 s6), p2:(LEQ s0 s7)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 69 reset in 321 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-07 finished in 1204 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 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 5 ms. Remains 4 /9 variables (removed 5) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-19 08:19:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 08:19:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 08:19:31] [INFO ] Invariant cache hit.
[2023-03-19 08:19:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:19:31] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-19 08:19:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:19:31] [INFO ] Invariant cache hit.
[2023-03-19 08:19:31] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/9 places, 5/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 4/9 places, 5/8 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s1)], 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 490 steps with 0 reset in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-09 finished in 148 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 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 8 place count 3 transition count 5
Graph (trivial) has 3 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 2 transition count 5
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11 place count 2 transition count 3
Applied a total of 11 rules in 12 ms. Remains 2 /9 variables (removed 7) and now considering 3/8 (removed 5) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-19 08:19:32] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 08:19:32] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 08:19:32] [INFO ] Invariant cache hit.
[2023-03-19 08:19:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:19:32] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-19 08:19:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:19:32] [INFO ] Invariant cache hit.
[2023-03-19 08:19:32] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/9 places, 3/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 2/9 places, 3/8 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-10 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 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-10 finished in 145 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(G(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-19 08:19:32] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 08:19:32] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 08:19:32] [INFO ] Invariant cache hit.
[2023-03-19 08:19:32] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 08:19:32] [INFO ] Invariant cache hit.
[2023-03-19 08:19:32] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4937 steps with 0 reset in 12 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-11 finished in 205 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((p0||X((G(F(p1)) U !p0)))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 5 transition count 7
Applied a total of 5 rules in 4 ms. Remains 5 /9 variables (removed 4) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 5 cols
[2023-03-19 08:19:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 08:19:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 08:19:32] [INFO ] Invariant cache hit.
[2023-03-19 08:19:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:19:32] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-19 08:19:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:19:32] [INFO ] Invariant cache hit.
[2023-03-19 08:19:32] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/9 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 5/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 144 ms :[false, p0, (NOT p1), (NOT p1)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 s2), p1:(LEQ 3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-14 finished in 251 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)||G((F(!p0)&&F(p1))))))'
[2023-03-19 08:19:32] [INFO ] Flatten gal took : 3 ms
[2023-03-19 08:19:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-19 08:19:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 1 ms.
Total runtime 9084 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/939/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-04

BK_STOP 1679213974132

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name SmallOperatingSystem-PT-MT0064DC0032-LTLCardinality-04
ltl formula formula --ltl=/tmp/939/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 9 places, 8 transitions and 27 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/939/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/939/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/939/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/939/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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="SmallOperatingSystem-PT-MT0064DC0032"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SmallOperatingSystem-PT-MT0064DC0032, 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 r457-smll-167912648800035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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