fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r045-oct2-162038291300005
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for CircadianClock-PT-000001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
376.968 11385.00 21514.00 470.40 FFTFFTFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291300005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CircadianClock-PT-000001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291300005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.7K Mar 22 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 12K May 5 16:51 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 CircadianClock-PT-000001-00
FORMULA_NAME CircadianClock-PT-000001-01
FORMULA_NAME CircadianClock-PT-000001-02
FORMULA_NAME CircadianClock-PT-000001-03
FORMULA_NAME CircadianClock-PT-000001-04
FORMULA_NAME CircadianClock-PT-000001-05
FORMULA_NAME CircadianClock-PT-000001-06
FORMULA_NAME CircadianClock-PT-000001-07
FORMULA_NAME CircadianClock-PT-000001-08
FORMULA_NAME CircadianClock-PT-000001-09
FORMULA_NAME CircadianClock-PT-000001-10
FORMULA_NAME CircadianClock-PT-000001-11
FORMULA_NAME CircadianClock-PT-000001-12
FORMULA_NAME CircadianClock-PT-000001-13
FORMULA_NAME CircadianClock-PT-000001-14
FORMULA_NAME CircadianClock-PT-000001-15

=== Now, execution of the tool begins

BK_START 1620558615487

Running Version 0
[2021-05-09 11:10:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 11:10:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 11:10:19] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-09 11:10:19] [INFO ] Transformed 14 places.
[2021-05-09 11:10:19] [INFO ] Transformed 16 transitions.
[2021-05-09 11:10:19] [INFO ] Found NUPN structural information;
[2021-05-09 11:10:19] [INFO ] Parsed PT model containing 14 places and 16 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 11:10:19] [INFO ] Initial state test concluded for 2 properties.
FORMULA CircadianClock-PT-000001-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 35 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:19] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:19] [INFO ] Computed 7 place invariants in 10 ms
[2021-05-09 11:10:19] [INFO ] Implicit Places using invariants in 102 ms returned []
[2021-05-09 11:10:19] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:19] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:19] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2021-05-09 11:10:19] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:19] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:19] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
[2021-05-09 11:10:20] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 11:10:20] [INFO ] Flatten gal took : 43 ms
FORMULA CircadianClock-PT-000001-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000001-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000001-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 11:10:20] [INFO ] Flatten gal took : 4 ms
[2021-05-09 11:10:20] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=628 ) properties (out of 19) seen :18
Running SMT prover for 1 properties.
[2021-05-09 11:10:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:20] [INFO ] Computed 7 place invariants in 1 ms
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0)||X(X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:20] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-09 11:10:20] [INFO ] Implicit Places using invariants in 24 ms returned []
[2021-05-09 11:10:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:20] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-09 11:10:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-09 11:10:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:20] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:20] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-000001-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s4 1)), p1:(AND (EQ s7 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 11900 reset in 163 ms.
Stack based approach found an accepted trace after 31 steps with 2 reset with depth 7 and stack size 7 in 0 ms.
FORMULA CircadianClock-PT-000001-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000001-00 finished in 579 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 7 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:21] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-09 11:10:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:21] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-09 11:10:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:21] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-09 11:10:21] [INFO ] Redundant transitions in 6 ms returned []
[2021-05-09 11:10:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:21] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:21] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CircadianClock-PT-000001-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 6 in 0 ms.
FORMULA CircadianClock-PT-000001-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000001-01 finished in 243 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0||G(p1)) U p2)||X(!p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:21] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:21] [INFO ] Implicit Places using invariants in 17 ms returned []
[2021-05-09 11:10:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:21] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-09 11:10:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:21] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-09 11:10:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), false, true, (NOT p1), (NOT p2)]
Running random walk in product with property : CircadianClock-PT-000001-02 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=6 dest: 5}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s7 1) (EQ s9 1)), p0:(EQ s7 1), p1:(AND (EQ s3 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Knowledge obtained : [(NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), false, true, (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 217 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), false, true, (NOT p1), (NOT p2)]
Support contains 4 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:23] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-09 11:10:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:23] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:23] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
[2021-05-09 11:10:23] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:10:23] [INFO ] Flatten gal took : 6 ms
[2021-05-09 11:10:23] [INFO ] Time to serialize gal into /tmp/LTL7993796379134386890.gal : 3 ms
[2021-05-09 11:10:23] [INFO ] Time to serialize properties into /tmp/LTL5544292643021618420.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7993796379134386890.gal, -t, CGAL, -LTL, /tmp/LTL5544292643021618420.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7993796379134386890.gal -t CGAL -LTL /tmp/LTL5544292643021618420.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((("(mr==1)")||(G("((da_a==1)&&(a_cap==1))")))U("((mr==1)&&(r_cap==1))"))||(X("((da_a==0)||(a_cap==0))"))))
Formula 0 simplified : !((("(mr==1)" | G"((da_a==1)&&(a_cap==1))") U "((mr==1)&&(r_cap==1))") | X"((da_a==0)||(a_cap==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.024909,18052,1,0,6,313,34,0,364,210,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircadianClock-PT-000001-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CircadianClock-PT-000001-02 finished in 2135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((X(X(p0))&&(G(p1) U X(p0)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:23] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-09 11:10:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:23] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:23] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-09 11:10:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:23] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CircadianClock-PT-000001-03 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=p0, acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=4, aps=[p1:(EQ s7 1), p0:(AND (EQ s1 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CircadianClock-PT-000001-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000001-03 finished in 282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||F(p1)||X((p2 U p3)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:23] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2021-05-09 11:10:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:23] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:23] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2021-05-09 11:10:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:23] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-09 11:10:23] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : CircadianClock-PT-000001-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s0 1), p1:(AND (EQ s0 1) (EQ s8 1) (EQ s12 1)), p3:(AND (EQ s0 1) (EQ s4 1) (EQ s0 1)), p2:(AND (EQ s0 1) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4432 reset in 69 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA CircadianClock-PT-000001-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000001-04 finished in 242 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:24] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:24] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-09 11:10:24] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:24] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircadianClock-PT-000001-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s8 1) (EQ s12 1) (EQ s0 1) (EQ s8 1) (EQ s12 1)), p0:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 73 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 8 in 0 ms.
FORMULA CircadianClock-PT-000001-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000001-07 finished in 222 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:24] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2021-05-09 11:10:24] [INFO ] Redundant transitions in 6 ms returned []
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CircadianClock-PT-000001-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 1) (AND (EQ s6 1) (EQ s13 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 29508 reset in 62 ms.
Stack based approach found an accepted trace after 11 steps with 5 reset with depth 2 and stack size 2 in 0 ms.
FORMULA CircadianClock-PT-000001-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000001-08 finished in 210 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:24] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2021-05-09 11:10:24] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:24] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CircadianClock-PT-000001-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 29698 reset in 66 ms.
Stack based approach found an accepted trace after 17 steps with 7 reset with depth 2 and stack size 2 in 0 ms.
FORMULA CircadianClock-PT-000001-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000001-09 finished in 204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:24] [INFO ] Implicit Places using invariants in 17 ms returned []
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:24] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-09 11:10:24] [INFO ] Redundant transitions in 11 ms returned []
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : CircadianClock-PT-000001-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10518 reset in 68 ms.
Stack based approach found an accepted trace after 5 steps with 1 reset with depth 3 and stack size 3 in 0 ms.
FORMULA CircadianClock-PT-000001-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000001-10 finished in 191 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||(p1&&X(G((X(G(p3))||p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:24] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-09 11:10:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:24] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-09 11:10:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:24] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-09 11:10:24] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Running random walk in product with property : CircadianClock-PT-000001-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={1} source=1 dest: 1}, { cond=p0, acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={1, 2} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p0 p2 p3), acceptance={2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={0, 2} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p3), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 p3), acceptance={0, 2} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p3), acceptance={0, 2} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s9 1)), p1:(OR (NEQ s3 1) (NEQ s11 1)), p2:(OR (NEQ s3 1) (NEQ s11 1)), p3:(OR (AND (EQ s3 1) (EQ s11 1)) (AND (EQ s0 1) (EQ s4 1)))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 124 ms.
Stack based approach found an accepted trace after 100 steps with 0 reset with depth 101 and stack size 42 in 0 ms.
FORMULA CircadianClock-PT-000001-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000001-13 finished in 322 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(F(p0))||(F((G(p0)||G(p2)))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:25] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:25] [INFO ] Implicit Places using invariants in 44 ms returned []
[2021-05-09 11:10:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:25] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-09 11:10:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:25] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2021-05-09 11:10:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:25] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:25] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircadianClock-PT-000001-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s10 1)), p1:(AND (EQ s0 1) (EQ s8 1) (EQ s12 1)), p2:(AND (EQ s0 1) (EQ s8 1) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8910 reset in 122 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA CircadianClock-PT-000001-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000001-14 finished in 444 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((G(p1)&&X(!p2))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-09 11:10:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:25] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:25] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-09 11:10:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:25] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 11:10:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 11:10:26] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2021-05-09 11:10:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-09 11:10:26] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 11:10:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Running random walk in product with property : CircadianClock-PT-000001-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s3 1) (NEQ s13 1)), p1:(OR (NEQ s3 1) (NEQ s13 1) (NEQ s7 1) (NEQ s9 1)), p2:(AND (EQ s7 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3204 reset in 79 ms.
Stack based approach found an accepted trace after 165 steps with 8 reset with depth 38 and stack size 17 in 0 ms.
FORMULA CircadianClock-PT-000001-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000001-15 finished in 904 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620558626872

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="CircadianClock-PT-000001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CircadianClock-PT-000001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r045-oct2-162038291300005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000001.tgz
mv CircadianClock-PT-000001 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;