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-167912648800068.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-MT0256DC0128, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912648800068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 9.1K Feb 25 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:46 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.2K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Feb 25 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:47 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-MT0256DC0128-LTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679226604133

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmallOperatingSystem-PT-MT0256DC0128
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 11:50:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 11:50:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:50:07] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-19 11:50:07] [INFO ] Transformed 9 places.
[2023-03-19 11:50:07] [INFO ] Transformed 8 transitions.
[2023-03-19 11:50:07] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-07 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 11:50:08] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-19 11:50:08] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-19 11:50:08] [INFO ] Invariant cache hit.
[2023-03-19 11:50:08] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-19 11:50:08] [INFO ] Invariant cache hit.
[2023-03-19 11:50:08] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 409 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 11:50:08] [INFO ] Flatten gal took : 28 ms
[2023-03-19 11:50:08] [INFO ] Flatten gal took : 7 ms
[2023-03-19 11:50:08] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 2832 steps, including 0 resets, run visited all 10 properties in 34 ms. (steps per millisecond=83 )
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F(G((p0||F((p1&&F(p2)))))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
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 7 transition count 7
Applied a total of 3 rules in 12 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 11:50:09] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 11:50:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 11:50:09] [INFO ] Invariant cache hit.
[2023-03-19 11:50:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 11:50:09] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-19 11:50:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:50:09] [INFO ] Invariant cache hit.
[2023-03-19 11:50:09] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 452 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1)), p2:(GEQ s6 1), p1:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8433 steps with 0 reset in 148 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-01 finished in 866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 10 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 11:50:10] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-19 11:50:10] [INFO ] Implicit Places using invariants in 46 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/9 places, 5/8 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 3 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-19 11:50:10] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 11:50:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 11:50:10] [INFO ] Invariant cache hit.
[2023-03-19 11:50:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/9 places, 3/8 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 2/9 places, 3/8 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-02 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(F(p0)))'
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.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 4 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-19 11:50:10] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-19 11:50:10] [INFO ] Implicit Places using invariants in 37 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
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 2 place count 6 transition count 6
Applied a total of 2 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-19 11:50:10] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 11:50:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 11:50:10] [INFO ] Invariant cache hit.
[2023-03-19 11:50:10] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/9 places, 6/8 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 6/9 places, 6/8 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11466 reset in 343 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-03 finished in 585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!X(p0))) U X((G(p0) U 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 11:50:11] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 11:50:11] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 11:50:11] [INFO ] Invariant cache hit.
[2023-03-19 11:50:11] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-19 11:50:11] [INFO ] Invariant cache hit.
[2023-03-19 11:50:11] [INFO ] Dead Transitions using invariants and state equation in 51 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 134 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 270 ms :[p0, (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6458 reset in 179 ms.
Stack based approach found an accepted trace after 26 steps with 2 reset with depth 8 and stack size 8 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-04 finished in 609 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((!p0||F(p1))))'
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 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 11:50:11] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 11:50:11] [INFO ] Implicit Places using invariants in 42 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 7/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(GEQ s3 1), p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24986 reset in 115 ms.
Product exploration explored 100000 steps with 24941 reset in 188 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) p0), (X (AND p0 (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Finished random walk after 130 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
// Phase 1: matrix 8 rows 7 cols
[2023-03-19 11:50:12] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 11:50:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 11:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:50:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 11:50:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:50:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 11:50:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:50:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-19 11:50:12] [INFO ] Computed and/alt/rep : 7/10/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-19 11:50:13] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 7 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 : 7/7 places, 8/8 transitions.
Graph (trivial) has 2 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-19 11:50:13] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 11:50:13] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 11:50:13] [INFO ] Invariant cache hit.
[2023-03-19 11:50:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 11:50:13] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-19 11:50:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 11:50:13] [INFO ] Invariant cache hit.
[2023-03-19 11:50:13] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/7 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 6/7 places, 7/8 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 : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Finished random walk after 130 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=130 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
[2023-03-19 11:50:13] [INFO ] Invariant cache hit.
[2023-03-19 11:50:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 11:50:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:50:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-19 11:50:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:50:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 11:50:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:50:13] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-19 11:50:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 11:50:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-19 11:50:13] [INFO ] Computed and/alt/rep : 6/8/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-19 11:50:13] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 24912 reset in 86 ms.
Product exploration explored 100000 steps with 24982 reset in 99 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 7/7 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5 transition count 6
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 6
Applied a total of 2 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 5 cols
[2023-03-19 11:50:13] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 11:50:13] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-19 11:50:13] [INFO ] Invariant cache hit.
[2023-03-19 11:50:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 11:50:14] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-19 11:50:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:50:14] [INFO ] Invariant cache hit.
[2023-03-19 11:50:14] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/6 places, 6/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 485 ms. Remains : 5/6 places, 6/7 transitions.
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-05 finished in 2614 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 4 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 11:50:14] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 11:50:14] [INFO ] Implicit Places using invariants in 44 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/9 places, 5/8 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 3 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-19 11:50:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 11:50:14] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 11:50:14] [INFO ] Invariant cache hit.
[2023-03-19 11:50:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/9 places, 3/8 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 2/9 places, 3/8 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], 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 0 steps with 0 reset in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-06 finished in 199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(!p1)))))'
Support contains 3 out of 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
Applied a total of 2 rules in 1 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 11:50:14] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 11:50:14] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 11:50:14] [INFO ] Invariant cache hit.
[2023-03-19 11:50:14] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 11:50:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:50:14] [INFO ] Invariant cache hit.
[2023-03-19 11:50:14] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1)), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 147 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-08 finished in 409 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||G(!p1)))||X((p2 U p3))))'
Support contains 7 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 11:50:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 11:50:15] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-19 11:50:15] [INFO ] Invariant cache hit.
[2023-03-19 11:50:15] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-19 11:50:15] [INFO ] Invariant cache hit.
[2023-03-19 11:50:15] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 9/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 393 ms :[true, (AND p0 p1 (NOT p3)), (AND p1 (NOT p3)), (AND p0 p1 (NOT p3)), p1, (AND p1 p0), (NOT p3)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(GEQ s7 1), p1:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1)), p3:(AND (GEQ s4 1) (GEQ s6 1)), p2:(GEQ s8 1)], 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24976 reset in 199 ms.
Product exploration explored 100000 steps with 25074 reset in 149 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) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (AND (NOT p3) p2)), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (AND (NOT p1) (NOT p3) p2)), (X (AND (NOT p0) (NOT p3) p2)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2))))]
Knowledge based reduction with 27 factoid took 1885 ms. Reduced automaton from 7 states, 21 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Incomplete random walk after 10053 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=359 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:50:18] [INFO ] Invariant cache hit.
[2023-03-19 11:50:18] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-19 11:50:18] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 11:50:18] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:50:18] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:50:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-19 11:50:18] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:50:18] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-19 11:50:18] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (AND (NOT p3) p2)), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (AND (NOT p1) (NOT p3) p2)), (X (AND (NOT p0) (NOT p3) p2)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0), (F (AND p2 (NOT p3) (NOT p0))), (F (AND p2 (NOT p3) p1)), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (AND (NOT p2) (NOT p3) p1)), (F (AND p2 (NOT p3) (NOT p1) p0)), (F (AND p2 (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p1) p0)), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F (AND p2 (NOT p3))), (F (AND p2 (NOT p3) p1 p0)), (F (AND (NOT p2) (NOT p3) p1 p0))]
Knowledge based reduction with 27 factoid took 2477 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Stuttering acceptance computed with spot in 376 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Support contains 7 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.
[2023-03-19 11:50:21] [INFO ] Invariant cache hit.
[2023-03-19 11:50:21] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-19 11:50:21] [INFO ] Invariant cache hit.
[2023-03-19 11:50:21] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-19 11:50:21] [INFO ] Invariant cache hit.
[2023-03-19 11:50:21] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 9/9 places, 8/8 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 p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3) p1 p0))), (X (NOT (AND p2 (NOT p3) p1 p0))), (X (AND p2 (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1)))))]
Knowledge based reduction with 21 factoid took 1695 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Incomplete random walk after 10060 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=457 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:50:24] [INFO ] Invariant cache hit.
[2023-03-19 11:50:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 11:50:24] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 11:50:24] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:50:24] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:50:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 11:50:24] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:50:24] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-19 11:50:24] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3) p1 p0))), (X (NOT (AND p2 (NOT p3) p1 p0))), (X (AND p2 (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0), (F (AND p2 (NOT p3) (NOT p0))), (F (AND p2 (NOT p3) p1)), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (AND (NOT p2) (NOT p3) p1)), (F (AND p2 (NOT p3) (NOT p1) p0)), (F (AND p2 (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p1) p0)), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F (AND p2 (NOT p3))), (F (AND p2 (NOT p3) p1 p0)), (F (AND (NOT p2) (NOT p3) p1 p0))]
Knowledge based reduction with 21 factoid took 2092 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Stuttering acceptance computed with spot in 359 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Stuttering acceptance computed with spot in 498 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Product exploration explored 100000 steps with 24991 reset in 250 ms.
Product exploration explored 100000 steps with 25087 reset in 272 ms.
Applying partial POR strategy [true, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Support contains 7 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_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.
[2023-03-19 11:50:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 11:50:28] [INFO ] Invariant cache hit.
[2023-03-19 11:50:28] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 7 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.
[2023-03-19 11:50:28] [INFO ] Invariant cache hit.
[2023-03-19 11:50:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 11:50:28] [INFO ] Invariant cache hit.
[2023-03-19 11:50:28] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 11:50:28] [INFO ] Invariant cache hit.
[2023-03-19 11:50:28] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 9/9 places, 8/8 transitions.
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-09 finished in 13815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 2 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 11:50:28] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 11:50:28] [INFO ] Implicit Places using invariants in 21 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/9 places, 5/8 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 2 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-19 11:50:28] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 11:50:28] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 11:50:28] [INFO ] Invariant cache hit.
[2023-03-19 11:50:28] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/9 places, 3/8 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 2/9 places, 3/8 transitions.
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-10 finished in 151 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 U 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
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
Applied a total of 2 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 11:50:28] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 11:50:29] [INFO ] Implicit Places using invariants in 34 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 7/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38 ms. Remains : 6/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), p1]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s3 1), p1:(GEQ s5 1)], 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 25054 reset in 70 ms.
Product exploration explored 100000 steps with 24969 reset in 77 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) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 500 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 90 ms :[(NOT p0), p1]
Finished random walk after 1161 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=387 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 515 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 86 ms :[(NOT p0), p1]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), p1]
// Phase 1: matrix 7 rows 6 cols
[2023-03-19 11:50:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 11:50:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 11:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:50:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-19 11:50:30] [INFO ] Computed and/alt/rep : 6/8/6 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-19 11:50:30] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 11:50:30] [INFO ] Invariant cache hit.
[2023-03-19 11:50:30] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 11:50:30] [INFO ] Invariant cache hit.
[2023-03-19 11:50:30] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-19 11:50:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:50:30] [INFO ] Invariant cache hit.
[2023-03-19 11:50:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 6/6 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) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 353 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 97 ms :[(NOT p0), p1]
Finished random walk after 1161 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=387 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 618 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 108 ms :[(NOT p0), p1]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), p1]
[2023-03-19 11:50:32] [INFO ] Invariant cache hit.
[2023-03-19 11:50:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 11:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:50:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-19 11:50:32] [INFO ] Computed and/alt/rep : 6/8/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-19 11:50:32] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), p1]
Product exploration explored 100000 steps with 25130 reset in 106 ms.
Product exploration explored 100000 steps with 25028 reset in 123 ms.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 11:50:32] [INFO ] Invariant cache hit.
[2023-03-19 11:50:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 11:50:32] [INFO ] Invariant cache hit.
[2023-03-19 11:50:32] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 11:50:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:50:32] [INFO ] Invariant cache hit.
[2023-03-19 11:50:32] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 6/6 places, 7/7 transitions.
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-11 finished in 3725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_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 11:50:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 11:50:32] [INFO ] Implicit Places using invariants in 26 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
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 2 place count 7 transition count 8
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 7 cols
[2023-03-19 11:50:32] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 11:50:32] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 11:50:32] [INFO ] Invariant cache hit.
[2023-03-19 11:50:32] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/9 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 7/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s3 1) (GEQ s0 1) (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-14 finished in 336 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 11:50:33] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 11:50:33] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 11:50:33] [INFO ] Invariant cache hit.
[2023-03-19 11:50:33] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-19 11:50:33] [INFO ] Invariant cache hit.
[2023-03-19 11:50:33] [INFO ] Dead Transitions using invariants and state equation in 40 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 146 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, p0, p0]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1))], 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 9 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-15 finished in 287 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((!p0||F(p1))))'
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||G(!p1)))||X((p2 U p3))))'
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 p1)) U p0))'
[2023-03-19 11:50:33] [INFO ] Flatten gal took : 4 ms
[2023-03-19 11:50:33] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-19 11:50:33] [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 26113 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1779/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1779/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1779/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-05
Could not compute solution for formula : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-09
Could not compute solution for formula : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-11

BK_STOP 1679226635802

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-05
ltl formula formula --ltl=/tmp/1779/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/1779/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1779/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1779/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1779/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-09
ltl formula formula --ltl=/tmp/1779/ltl_1_
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
pnml2lts-mc( 0/ 4): Petri net has 9 places, 8 transitions and 27 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1779/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
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/1779/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1779/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1779/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-11
ltl formula formula --ltl=/tmp/1779/ltl_2_
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: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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
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( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1779/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1779/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1779/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1779/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-MT0256DC0128"
export BK_EXAMINATION="LTLFireability"
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-MT0256DC0128, examination is LTLFireability"
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-167912648800068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0256DC0128.tgz
mv SmallOperatingSystem-PT-MT0256DC0128 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;