fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r455-smll-167912646900075
Last Updated
May 14, 2023

About the Execution of LoLa+red for SmallOperatingSystem-PT-MT0512DC0128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
307.848 18639.00 30607.00 482.30 TTFFFTFFFFFFTFFF normal

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.r455-smll-167912646900075.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 lolaxred
Input is SmallOperatingSystem-PT-MT0512DC0128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912646900075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 9.1K Feb 25 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:42 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.5K Feb 25 17:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 213K Feb 25 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:08 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-MT0512DC0128-LTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679185233771

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmallOperatingSystem-PT-MT0512DC0128
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 00:20:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 00:20:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:20:37] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-19 00:20:37] [INFO ] Transformed 9 places.
[2023-03-19 00:20:37] [INFO ] Transformed 8 transitions.
[2023-03-19 00:20:37] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-05 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 17 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 00:20:37] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-19 00:20:38] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-19 00:20:38] [INFO ] Invariant cache hit.
[2023-03-19 00:20:38] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-19 00:20:38] [INFO ] Invariant cache hit.
[2023-03-19 00:20:38] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 00:20:38] [INFO ] Flatten gal took : 28 ms
[2023-03-19 00:20:38] [INFO ] Flatten gal took : 7 ms
[2023-03-19 00:20:38] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10051 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=121 ) properties (out of 23) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 00:20:40] [INFO ] Invariant cache hit.
[2023-03-19 00:20:40] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-19 00:20:40] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2023-03-19 00:20:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 00:20:40] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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) U G(p1))||G(F(p2))))'
Support contains 3 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
Applied a total of 0 rules in 8 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 00:20:40] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 00:20:40] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 00:20:40] [INFO ] Invariant cache hit.
[2023-03-19 00:20:40] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-19 00:20:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:20:40] [INFO ] Invariant cache hit.
[2023-03-19 00:20:40] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 815 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(NOT p1), acceptance={} source=7 dest: 2}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ s3 s4), p1:(AND (LEQ 1 s7) (LEQ s3 s4)), p2:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 14827 reset in 598 ms.
Stack based approach found an accepted trace after 106 steps with 19 reset with depth 15 and stack size 15 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-02 finished in 1680 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 3 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 00:20:42] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 00:20:42] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 00:20:42] [INFO ] Invariant cache hit.
[2023-03-19 00:20:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-19 00:20:42] [INFO ] Invariant cache hit.
[2023-03-19 00:20:42] [INFO ] Dead Transitions using invariants and state equation in 33 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 117 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-03 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 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-03 finished in 253 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)) U (p1||G(p2))))'
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
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 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
[2023-03-19 00:20:42] [INFO ] Invariant cache hit.
[2023-03-19 00:20:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 00:20:42] [INFO ] Invariant cache hit.
[2023-03-19 00:20:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 00:20:42] [INFO ] Invariant cache hit.
[2023-03-19 00:20:42] [INFO ] Dead Transitions using invariants and state equation in 30 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 104 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 2 s3), p2:(LEQ s4 s0), p0:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 257 ms.
Product exploration explored 100000 steps with 0 reset in 338 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) p2 (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (AND (NOT p1) p2)), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X p2))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 938 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p2), (OR (NOT p2) p0)]
Finished random walk after 5031 steps, including 1 resets, run visited all 3 properties in 8 ms. (steps per millisecond=628 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (AND (NOT p1) p2)), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X p2))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (OR p0 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 14 factoid took 541 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-04 finished in 2590 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 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
[2023-03-19 00:20:45] [INFO ] Invariant cache hit.
[2023-03-19 00:20:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 00:20:45] [INFO ] Invariant cache hit.
[2023-03-19 00:20:45] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-19 00:20:45] [INFO ] Invariant cache hit.
[2023-03-19 00:20:45] [INFO ] Dead Transitions using invariants and state equation in 54 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 189 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-06 finished in 358 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)&&G(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
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.
Iterating post reduction 1 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 2 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 16 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 5 cols
[2023-03-19 00:20:45] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 00:20:45] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 00:20:45] [INFO ] Invariant cache hit.
[2023-03-19 00:20:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 00:20:45] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-19 00:20:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:20:45] [INFO ] Invariant cache hit.
[2023-03-19 00:20:45] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/9 places, 6/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 5/9 places, 6/8 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ 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 s0 s2), p1:(LEQ 3 s0)], 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]]
Product exploration explored 100000 steps with 0 reset in 484 ms.
Product exploration explored 100000 steps with 0 reset in 347 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 p0 p1), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Finished random walk after 513 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=513 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 265 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 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 5 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 : 5/5 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-19 00:20:47] [INFO ] Invariant cache hit.
[2023-03-19 00:20:47] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 00:20:47] [INFO ] Invariant cache hit.
[2023-03-19 00:20:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 00:20:47] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-19 00:20:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:20:47] [INFO ] Invariant cache hit.
[2023-03-19 00:20:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 5/5 places, 6/6 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 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 96 ms :[(NOT p1), (NOT p1)]
Finished random walk after 513 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=513 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 197 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 96 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Product exploration explored 100000 steps with 0 reset in 143 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 6/6 transitions.
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 5 transition count 5
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 3 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 2 transition count 5
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 2 transition count 3
Applied a total of 6 rules in 10 ms. Remains 2 /5 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-19 00:20:48] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 00:20:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 00:20:48] [INFO ] Invariant cache hit.
[2023-03-19 00:20:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 00:20:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-19 00:20:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:20:48] [INFO ] Invariant cache hit.
[2023-03-19 00:20:48] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/5 places, 3/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 2/5 places, 3/6 transitions.
Treatment of property SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-07 finished in 3303 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))))'
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 00:20:48] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 00:20:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 00:20:48] [INFO ] Invariant cache hit.
[2023-03-19 00:20:48] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-19 00:20:48] [INFO ] Invariant cache hit.
[2023-03-19 00:20:49] [INFO ] Dead Transitions using invariants and state equation in 39 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 117 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-08 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: 2}]], initial=3, aps=[p0:(GT s1 s2)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 96681 steps with 0 reset in 148 ms.
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-08 finished in 457 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)))'
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
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
[2023-03-19 00:20:49] [INFO ] Invariant cache hit.
[2023-03-19 00:20:49] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 00:20:49] [INFO ] Invariant cache hit.
[2023-03-19 00:20:49] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-19 00:20:49] [INFO ] Invariant cache hit.
[2023-03-19 00:20:49] [INFO ] Dead Transitions using invariants and state equation in 36 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 120 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 s2)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 117 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-12 finished in 542 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((X(X(p0)) U (G((p1&&X(p0)))&&F(p2)))))'
Support contains 4 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.
[2023-03-19 00:20:49] [INFO ] Invariant cache hit.
[2023-03-19 00:20:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 00:20:49] [INFO ] Invariant cache hit.
[2023-03-19 00:20:49] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 00:20:49] [INFO ] Invariant cache hit.
[2023-03-19 00:20:50] [INFO ] Dead Transitions using invariants and state equation in 37 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 111 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (NOT p2), (NOT p0), true]
Running random walk in product with property : SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ s4 s1), p2:(LEQ s3 s7), p0:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-13 finished in 599 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 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
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 00:20:50] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 00:20:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 00:20:50] [INFO ] Invariant cache hit.
[2023-03-19 00:20:50] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-19 00:20:50] [INFO ] Invariant cache hit.
[2023-03-19 00:20:50] [INFO ] Dead Transitions using invariants and state equation in 32 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 115 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-14 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 s4 s1)], 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 1109 steps with 0 reset in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0512DC0128-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(p0)&&G(F(p1))))'
[2023-03-19 00:20:51] [INFO ] Flatten gal took : 10 ms
[2023-03-19 00:20:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 00:20:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 0 ms.
Total runtime 13733 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SmallOperatingSystem-PT-MT0512DC0128
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679185252410

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 7 (type EXCL) for 0 SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-07
lola: result : false
lola: markings : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 5 (type EXCL) for 0 SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 5 (type EXCL) for SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-07
lola: result : false
lola: markings : 513
lola: fired transitions : 1533
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SmallOperatingSystem-PT-MT0512DC0128-LTLCardinality-07: CONJ false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-MT0512DC0128"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is SmallOperatingSystem-PT-MT0512DC0128, 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 r455-smll-167912646900075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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