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-167912647000147.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-MT8192DC4096, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647000147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 11K Feb 25 12:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 12:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:48 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.4K 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.8K Feb 25 17:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K 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.1K 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-MT8192DC4096-LTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679200975923

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-MT8192DC4096
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 04:42:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 04:42:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 04:42:59] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-19 04:42:59] [INFO ] Transformed 9 places.
[2023-03-19 04:42:59] [INFO ] Transformed 8 transitions.
[2023-03-19 04:43:00] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 191 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 1 formulas.
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-06 FALSE 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 18 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 04:43:00] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-19 04:43:00] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-19 04:43:00] [INFO ] Invariant cache hit.
[2023-03-19 04:43:00] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-19 04:43:00] [INFO ] Invariant cache hit.
[2023-03-19 04:43:00] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 04:43:01] [INFO ] Flatten gal took : 27 ms
[2023-03-19 04:43:01] [INFO ] Flatten gal took : 7 ms
[2023-03-19 04:43:01] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 12293 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=396 ) properties (out of 29) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=7 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-19 04:43:01] [INFO ] Invariant cache hit.
[2023-03-19 04:43:02] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-19 04:43:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 04:43:02] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :8
[2023-03-19 04:43:02] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :8
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-19 04:43:02] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :8
Fused 15 Parikh solutions to 8 different solutions.
Finished Parikh walk after 24580 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=1068 )
Parikh walk visited 8 properties in 1863 ms.
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((p0 U p1) U G((((p2 U p3)||p3)&&X(p0))))))'
Support contains 5 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 3 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 04:43:04] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 04:43:04] [INFO ] Implicit Places using invariants in 43 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 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 3 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 64 ms. Remains : 7/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 551 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p2) p3), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p3), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND p1 p3), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 s0), p2:(LEQ s1 s3), p3:(LEQ s0 s6), p0:(LEQ s4 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 589 ms.
Product exploration explored 100000 steps with 0 reset in 439 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 p1 (NOT p2) (NOT p3) p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (OR (AND (NOT p1) p2) p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 703 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Incomplete random walk after 12293 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1756 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 8 rows 7 cols
[2023-03-19 04:43:07] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 04:43:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 04:43:07] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 04:43:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 04:43:07] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 04:43:07] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-19 04:43:07] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 20480 steps, including 0 resets, run visited all 3 properties in 421 ms. (steps per millisecond=48 )
Parikh walk visited 3 properties in 420 ms.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (OR (AND (NOT p1) p2) p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) p3))))]
False Knowledge obtained : [(F (AND p3 p0)), (F (AND p2 (NOT p3) p0)), (F (AND p1 p3)), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (OR (AND (NOT p1) p2) p3))]
Knowledge based reduction with 10 factoid took 933 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Stuttering acceptance computed with spot in 263 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Support contains 5 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 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.
[2023-03-19 04:43:10] [INFO ] Invariant cache hit.
[2023-03-19 04:43:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 04:43:10] [INFO ] Invariant cache hit.
[2023-03-19 04:43:10] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 04:43:10] [INFO ] Invariant cache hit.
[2023-03-19 04:43:10] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 7/7 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 p1 (NOT p2) (NOT p3) p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (OR (AND (NOT p1) p2) p3))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 726 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Incomplete random walk after 12293 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2458 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 04:43:11] [INFO ] Invariant cache hit.
[2023-03-19 04:43:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 04:43:11] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 04:43:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 04:43:11] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 04:43:11] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-19 04:43:11] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 20480 steps, including 0 resets, run visited all 3 properties in 494 ms. (steps per millisecond=41 )
Parikh walk visited 3 properties in 493 ms.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (OR (AND (NOT p1) p2) p3))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) p3))))]
False Knowledge obtained : [(F (AND p3 p0)), (F (AND p2 (NOT p3) p0)), (F (AND p1 p3)), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (OR (AND (NOT p1) p2) p3))]
Knowledge based reduction with 10 factoid took 920 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Stuttering acceptance computed with spot in 251 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Stuttering acceptance computed with spot in 252 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Product exploration explored 100000 steps with 0 reset in 210 ms.
Product exploration explored 100000 steps with 0 reset in 365 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 238 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Support contains 5 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 5 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 04:43:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 04:43:15] [INFO ] Invariant cache hit.
[2023-03-19 04:43:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 7/7 places, 8/8 transitions.
Support contains 5 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 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.
[2023-03-19 04:43:15] [INFO ] Invariant cache hit.
[2023-03-19 04:43:15] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 04:43:15] [INFO ] Invariant cache hit.
[2023-03-19 04:43:15] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 04:43:15] [INFO ] Invariant cache hit.
[2023-03-19 04:43:15] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 7/7 places, 8/8 transitions.
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02 finished in 10598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 8 place count 3 transition count 5
Graph (trivial) has 3 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 2 transition count 5
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11 place count 2 transition count 3
Applied a total of 11 rules in 21 ms. Remains 2 /9 variables (removed 7) and now considering 3/8 (removed 5) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-19 04:43:15] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 04:43:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 04:43:15] [INFO ] Invariant cache hit.
[2023-03-19 04:43:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 04:43:15] [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 04:43:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 04:43:15] [INFO ] Invariant cache hit.
[2023-03-19 04:43:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/9 places, 3/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 2/9 places, 3/8 transitions.
Stuttering acceptance computed with spot in 53 ms :[p0]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-04 finished in 190 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 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 5 ms. Remains 4 /9 variables (removed 5) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-19 04:43:15] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 04:43:15] [INFO ] Implicit Places using invariants in 37 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 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 4 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 04:43:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 04:43:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 04:43:15] [INFO ] Invariant cache hit.
[2023-03-19 04:43:15] [INFO ] Implicit Places using invariants and state equation in 25 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 105 ms. Remains : 2/9 places, 3/8 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-MT8192DC4096-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-05 finished in 176 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&&(!p0||X(!p0)))))'
Support contains 0 out of 9 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 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
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
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 2 with 2 rules applied. Total rules applied 7 place count 4 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 4 transition count 4
Applied a total of 9 rules in 8 ms. Remains 4 /9 variables (removed 5) and now considering 4/8 (removed 4) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-19 04:43:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 04:43:15] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-19 04:43:15] [INFO ] Invariant cache hit.
[2023-03-19 04:43:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 04:43:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-19 04:43:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 04:43:15] [INFO ] Invariant cache hit.
[2023-03-19 04:43:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/9 places, 4/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 4/9 places, 4/8 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 17 ms :[true]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-07 finished in 196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G((p0||F(p1))))&&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
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 4 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 04:43:15] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 04:43:15] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 04:43:15] [INFO ] Invariant cache hit.
[2023-03-19 04:43:15] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 04:43:15] [INFO ] Invariant cache hit.
[2023-03-19 04:43:15] [INFO ] Dead Transitions using invariants and state equation in 38 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 108 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 3 s1), p0:(AND (LEQ s6 s5) (LEQ 3 s1)), p1:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 288 ms.
Product exploration explored 100000 steps with 0 reset in 319 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 p2 p0 p1), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 12293 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2458 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 555198 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 555198 steps, saw 300884 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 04:43:20] [INFO ] Invariant cache hit.
[2023-03-19 04:43:20] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 04:43:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 04:43:20] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 04:43:20] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-19 04:43:20] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 16390 steps, including 0 resets, run visited all 2 properties in 177 ms. (steps per millisecond=92 )
Parikh walk visited 2 properties in 177 ms.
Knowledge obtained : [(AND p2 p0 p1), true, (X (X p2))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 04:43:21] [INFO ] Invariant cache hit.
[2023-03-19 04:43:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 04:43:21] [INFO ] Invariant cache hit.
[2023-03-19 04:43:21] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 04:43:21] [INFO ] Invariant cache hit.
[2023-03-19 04:43:21] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 7/7 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 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 12293 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2458 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 485546 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 485546 steps, saw 260410 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 04:43:25] [INFO ] Invariant cache hit.
[2023-03-19 04:43:25] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 04:43:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 04:43:25] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 04:43:25] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-19 04:43:25] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 16390 steps, including 0 resets, run visited all 2 properties in 148 ms. (steps per millisecond=110 )
Parikh walk visited 2 properties in 149 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Product exploration explored 100000 steps with 0 reset in 190 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 04:43:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 04:43:27] [INFO ] Invariant cache hit.
[2023-03-19 04:43:27] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 7/7 places, 7/7 transitions.
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 04:43:27] [INFO ] Invariant cache hit.
[2023-03-19 04:43:27] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 04:43:27] [INFO ] Invariant cache hit.
[2023-03-19 04:43:27] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 04:43:27] [INFO ] Invariant cache hit.
[2023-03-19 04:43:27] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 7/7 places, 7/7 transitions.
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08 finished in 11540 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&&X(G(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 0 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 04:43:27] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-19 04:43:27] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 04:43:27] [INFO ] Invariant cache hit.
[2023-03-19 04:43:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-19 04:43:27] [INFO ] Invariant cache hit.
[2023-03-19 04:43:27] [INFO ] Dead Transitions using invariants and state equation in 34 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 109 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-09 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 2 s7), p1:(GT 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-09 finished in 309 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&&X(p1)&&(p2||F(p3)))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 04:43:27] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 04:43:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 04:43:27] [INFO ] Invariant cache hit.
[2023-03-19 04:43:27] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-19 04:43:27] [INFO ] Invariant cache hit.
[2023-03-19 04:43:27] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 9/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 s3), p2:(GT 3 s6), p3:(GT s0 s1), p1:(GT 2 s1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28 reset in 203 ms.
Stack based approach found an accepted trace after 14 steps with 3 reset with depth 4 and stack size 4 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-10 finished in 605 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 2 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 3 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 04:43:28] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 04:43:28] [INFO ] Implicit Places using invariants in 39 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 7
Applied a total of 1 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-19 04:43:28] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 04:43:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 04:43:28] [INFO ] Invariant cache hit.
[2023-03-19 04:43:28] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/9 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s6)], 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 160 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-11 finished in 346 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
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.
// Phase 1: matrix 7 rows 7 cols
[2023-03-19 04:43:28] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 04:43:28] [INFO ] Implicit Places using invariants in 34 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in 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 LTL mode , in 2 iterations and 38 ms. Remains : 6/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2 reset in 188 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-12 finished in 345 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 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in 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 1 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 04:43:28] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 04:43:28] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 04:43:28] [INFO ] Invariant cache hit.
[2023-03-19 04:43:28] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 04:43:28] [INFO ] Invariant cache hit.
[2023-03-19 04:43:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 7/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 8/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT 2 s5) (GT s1 s0) (LEQ s6 s4))], 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 245 ms.
Product exploration explored 100000 steps with 50000 reset in 173 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 89 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-MT8192DC4096-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-13 finished in 734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-19 04:43:29] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 04:43:29] [INFO ] Implicit Places using invariants in 32 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6/9 places, 7/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 6/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s5)], 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 10662 reset in 125 ms.
Stack based approach found an accepted trace after 38 steps with 6 reset with depth 5 and stack size 5 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-14 finished in 354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(F((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
Applied a total of 1 rules in 0 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 04:43:30] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 04:43:30] [INFO ] Implicit Places using invariants in 30 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 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 0 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 34 ms. Remains : 7/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s1), p2:(LEQ 1 s2), p1:(LEQ 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-15 finished in 414 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 U p1) U G((((p2 U p3)||p3)&&X(p0))))))'
Found a Shortening insensitive property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02
Stuttering acceptance computed with spot in 395 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
[2023-03-19 04:43:30] [INFO ] Invariant cache hit.
[2023-03-19 04:43:31] [INFO ] Implicit Places using invariants in 29 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LI_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 LI_LTL mode , in 2 iterations and 35 ms. Remains : 7/9 places, 8/8 transitions.
Running random walk in product with property : SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p2) p3), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p3), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND p1 p3), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 s0), p2:(LEQ s1 s3), p3:(LEQ s0 s6), p0:(LEQ s4 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 194 ms.
Product exploration explored 100000 steps with 0 reset in 290 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 p1 (NOT p2) (NOT p3) p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (OR (AND (NOT p1) p2) p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 705 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Incomplete random walk after 12293 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3073 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 8 rows 7 cols
[2023-03-19 04:43:32] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-19 04:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 04:43:32] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 04:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 04:43:32] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 04:43:32] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-19 04:43:32] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 20480 steps, including 0 resets, run visited all 3 properties in 290 ms. (steps per millisecond=70 )
Parikh walk visited 3 properties in 290 ms.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (OR (AND (NOT p1) p2) p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) p3))))]
False Knowledge obtained : [(F (AND p3 p0)), (F (AND p2 (NOT p3) p0)), (F (AND p1 p3)), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (OR (AND (NOT p1) p2) p3))]
Knowledge based reduction with 10 factoid took 880 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Stuttering acceptance computed with spot in 253 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Support contains 5 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 04:43:34] [INFO ] Invariant cache hit.
[2023-03-19 04:43:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 04:43:34] [INFO ] Invariant cache hit.
[2023-03-19 04:43:34] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-19 04:43:34] [INFO ] Invariant cache hit.
[2023-03-19 04:43:34] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 7/7 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 p1 (NOT p2) (NOT p3) p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (OR (AND (NOT p1) p2) p3))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 687 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Incomplete random walk after 12293 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3073 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 04:43:35] [INFO ] Invariant cache hit.
[2023-03-19 04:43:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 04:43:35] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 04:43:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 04:43:35] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 04:43:35] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-19 04:43:35] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 20480 steps, including 0 resets, run visited all 3 properties in 327 ms. (steps per millisecond=62 )
Parikh walk visited 3 properties in 327 ms.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (OR (AND (NOT p1) p2) p3))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) p3))))]
False Knowledge obtained : [(F (AND p3 p0)), (F (AND p2 (NOT p3) p0)), (F (AND p1 p3)), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (OR (AND (NOT p1) p2) p3))]
Knowledge based reduction with 10 factoid took 910 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Stuttering acceptance computed with spot in 255 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Stuttering acceptance computed with spot in 259 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Product exploration explored 100000 steps with 0 reset in 185 ms.
Product exploration explored 100000 steps with 0 reset in 298 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 275 ms :[(AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p1 p3)]
Support contains 5 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 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.
[2023-03-19 04:43:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 04:43:38] [INFO ] Invariant cache hit.
[2023-03-19 04:43:38] [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 49 ms. Remains : 7/7 places, 8/8 transitions.
Support contains 5 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 04:43:38] [INFO ] Invariant cache hit.
[2023-03-19 04:43:39] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 04:43:39] [INFO ] Invariant cache hit.
[2023-03-19 04:43:39] [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 04:43:39] [INFO ] Invariant cache hit.
[2023-03-19 04:43:39] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 7/7 places, 8/8 transitions.
Treatment of property SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02 finished in 8668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G((p0||F(p1))))&&F(p2)))))'
[2023-03-19 04:43:39] [INFO ] Flatten gal took : 5 ms
[2023-03-19 04:43:39] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-19 04:43:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 1 ms.
Total runtime 39497 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SmallOperatingSystem-PT-MT8192DC4096
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1679201045898

--------------------
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:337
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: RELEASE
lola: RELEASE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 19/32 SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08 2858202 m, 571640 m/sec, 7103266 t fired, .

Time elapsed: 5 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02
lola: time limit : 3590 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3590 12/32 SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02 1774698 m, 354939 m/sec, 7628352 t fired, .

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3590 23/32 SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02 3477619 m, 340584 m/sec, 15118709 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-02: LTL unknown AGGR
SmallOperatingSystem-PT-MT8192DC4096-LTLCardinality-08: LTL unknown AGGR


Time elapsed: 25 secs. Pages in use: 32

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-MT8192DC4096"
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-MT8192DC4096, 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-167912647000147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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