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.r325-tall-167889197300483.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 itstools
Input is Referendum-PT-0020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197300483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 30K Feb 26 17:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 191K Feb 26 17:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 17:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 26 17:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 267K Feb 26 17:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 41K Feb 26 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 26 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 23K 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 Referendum-PT-0020-LTLCardinality-00
FORMULA_NAME Referendum-PT-0020-LTLCardinality-01
FORMULA_NAME Referendum-PT-0020-LTLCardinality-02
FORMULA_NAME Referendum-PT-0020-LTLCardinality-03
FORMULA_NAME Referendum-PT-0020-LTLCardinality-04
FORMULA_NAME Referendum-PT-0020-LTLCardinality-05
FORMULA_NAME Referendum-PT-0020-LTLCardinality-06
FORMULA_NAME Referendum-PT-0020-LTLCardinality-07
FORMULA_NAME Referendum-PT-0020-LTLCardinality-08
FORMULA_NAME Referendum-PT-0020-LTLCardinality-09
FORMULA_NAME Referendum-PT-0020-LTLCardinality-10
FORMULA_NAME Referendum-PT-0020-LTLCardinality-11
FORMULA_NAME Referendum-PT-0020-LTLCardinality-12
FORMULA_NAME Referendum-PT-0020-LTLCardinality-13
FORMULA_NAME Referendum-PT-0020-LTLCardinality-14
FORMULA_NAME Referendum-PT-0020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679012402718

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0020
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-17 00:20:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 00:20:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 00:20:04] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-17 00:20:04] [INFO ] Transformed 61 places.
[2023-03-17 00:20:04] [INFO ] Transformed 41 transitions.
[2023-03-17 00:20:04] [INFO ] Found NUPN structural information;
[2023-03-17 00:20:04] [INFO ] Parsed PT model containing 61 places and 41 transitions and 101 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-PT-0020-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 5 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2023-03-17 00:20:04] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-17 00:20:04] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-17 00:20:04] [INFO ] Invariant cache hit.
[2023-03-17 00:20:04] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-17 00:20:04] [INFO ] Invariant cache hit.
[2023-03-17 00:20:04] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 61/61 places, 41/41 transitions.
Support contains 61 out of 61 places after structural reductions.
[2023-03-17 00:20:04] [INFO ] Flatten gal took : 18 ms
[2023-03-17 00:20:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 00:20:04] [INFO ] Input system was already deterministic with 41 transitions.
Finished random walk after 48 steps, including 2 resets, run visited all 19 properties in 18 ms. (steps per millisecond=2 )
Computed a total of 61 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 41 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 41
Applied a total of 20 rules in 1 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2023-03-17 00:20:05] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 00:20:05] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 00:20:05] [INFO ] Invariant cache hit.
[2023-03-17 00:20:05] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-17 00:20:05] [INFO ] Invariant cache hit.
[2023-03-17 00:20:05] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/61 places, 41/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40)), p1:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4545 reset in 340 ms.
Product exploration explored 100000 steps with 4545 reset in 278 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 496 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 12 factoid took 535 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-17 00:20:07] [INFO ] Invariant cache hit.
[2023-03-17 00:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 00:20:07] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-17 00:20:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 00:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 00:20:07] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-17 00:20:07] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 00:20:07] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 00:20:07] [INFO ] Invariant cache hit.
[2023-03-17 00:20:07] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 00:20:07] [INFO ] Invariant cache hit.
[2023-03-17 00:20:07] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-17 00:20:07] [INFO ] Invariant cache hit.
[2023-03-17 00:20:07] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 41/41 places, 41/41 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 452 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 12 factoid took 609 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-17 00:20:09] [INFO ] Invariant cache hit.
[2023-03-17 00:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 00:20:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 00:20:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 00:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 00:20:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-17 00:20:09] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-17 00:20:09] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4545 reset in 260 ms.
Product exploration explored 100000 steps with 4545 reset in 251 ms.
Built C files in :
/tmp/ltsmin7028747240173238686
[2023-03-17 00:20:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7028747240173238686
Running compilation step : cd /tmp/ltsmin7028747240173238686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 304 ms.
Running link step : cd /tmp/ltsmin7028747240173238686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7028747240173238686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased467820559447609083.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 00:20:25] [INFO ] Invariant cache hit.
[2023-03-17 00:20:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-17 00:20:25] [INFO ] Invariant cache hit.
[2023-03-17 00:20:25] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-17 00:20:25] [INFO ] Invariant cache hit.
[2023-03-17 00:20:25] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 41/41 places, 41/41 transitions.
Built C files in :
/tmp/ltsmin17150999520816503885
[2023-03-17 00:20:25] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17150999520816503885
Running compilation step : cd /tmp/ltsmin17150999520816503885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 93 ms.
Running link step : cd /tmp/ltsmin17150999520816503885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17150999520816503885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17996104747001683554.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 00:20:40] [INFO ] Flatten gal took : 3 ms
[2023-03-17 00:20:40] [INFO ] Flatten gal took : 2 ms
[2023-03-17 00:20:40] [INFO ] Time to serialize gal into /tmp/LTL529404381424582824.gal : 1 ms
[2023-03-17 00:20:40] [INFO ] Time to serialize properties into /tmp/LTL18399412341305103051.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL529404381424582824.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14557994640416493962.hoa' '-atoms' '/tmp/LTL18399412341305103051.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18399412341305103051.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14557994640416493962.hoa
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39...260
Computing Next relation with stutter on 1.04858e+06 deadlock states
23 unique states visited
0 strongly connected components in search stack
42 transitions explored
23 items max in DFS search stack
37 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.38413,23160,1,0,185,11014,116,122,11061,15508,365
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0020-LTLCardinality-00 finished in 35819 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 20 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 21 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 21 transition count 21
Applied a total of 21 rules in 7 ms. Remains 21 /61 variables (removed 40) and now considering 21/41 (removed 20) transitions.
// Phase 1: matrix 21 rows 21 cols
[2023-03-17 00:20:41] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 00:20:41] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 00:20:41] [INFO ] Invariant cache hit.
[2023-03-17 00:20:41] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-17 00:20:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 00:20:41] [INFO ] Invariant cache hit.
[2023-03-17 00:20:41] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/61 places, 21/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 21/61 places, 21/41 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], 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 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0020-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLCardinality-01 finished in 551 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&&X(X(F(!p1)))))))'
Support contains 60 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2023-03-17 00:20:41] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-17 00:20:41] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-17 00:20:41] [INFO ] Invariant cache hit.
[2023-03-17 00:20:41] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-17 00:20:41] [INFO ] Invariant cache hit.
[2023-03-17 00:20:41] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 322 ms :[p1, p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true, (OR (NOT p0) p1)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(LEQ 1 (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60)), p0:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 1 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-02 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1||X(X(!p0))))))'
Support contains 20 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 41
Applied a total of 20 rules in 2 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2023-03-17 00:20:42] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 00:20:42] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 00:20:42] [INFO ] Invariant cache hit.
[2023-03-17 00:20:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 00:20:42] [INFO ] Invariant cache hit.
[2023-03-17 00:20:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/61 places, 41/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 321 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, p0, true, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=p0, acceptance={} source=7 dest: 9}], [{ cond=p0, acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p1:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15...], 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 186 ms.
Product exploration explored 100000 steps with 25000 reset in 197 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 351 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p0, p0, p0, p0, true]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 383 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0, p0, true]
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 00:20:44] [INFO ] Invariant cache hit.
[2023-03-17 00:20:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 00:20:44] [INFO ] Invariant cache hit.
[2023-03-17 00:20:44] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-17 00:20:44] [INFO ] Invariant cache hit.
[2023-03-17 00:20:44] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 41/41 places, 41/41 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p0, p0, p0, p0, true]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 173 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 164 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 174 ms.
Product exploration explored 100000 steps with 25000 reset in 172 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 255 ms :[p0, p0, p0, p0, true]
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 6 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 00:20:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 00:20:45] [INFO ] Invariant cache hit.
[2023-03-17 00:20:45] [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 48 ms. Remains : 41/41 places, 41/41 transitions.
Built C files in :
/tmp/ltsmin224049887579978139
[2023-03-17 00:20:45] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin224049887579978139
Running compilation step : cd /tmp/ltsmin224049887579978139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 99 ms.
Running link step : cd /tmp/ltsmin224049887579978139;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin224049887579978139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16421833643836916173.hoa' '--buchi-type=spotba'
LTSmin run took 143 ms.
FORMULA Referendum-PT-0020-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-PT-0020-LTLCardinality-03 finished in 4178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 21 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 41 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 41 transition count 41
Applied a total of 2 rules in 11 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2023-03-17 00:20:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 00:20:46] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 00:20:46] [INFO ] Invariant cache hit.
[2023-03-17 00:20:46] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-17 00:20:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 00:20:46] [INFO ] Invariant cache hit.
[2023-03-17 00:20:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/61 places, 41/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-04 finished in 194 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((X((F(p0) U X(!X(p1)))) U p2))))'
Support contains 60 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2023-03-17 00:20:46] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-17 00:20:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-17 00:20:46] [INFO ] Invariant cache hit.
[2023-03-17 00:20:46] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-17 00:20:46] [INFO ] Invariant cache hit.
[2023-03-17 00:20:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 1426 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=true, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 6}, { cond=p1, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(OR (LEQ (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 ...], 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-05 finished in 1563 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 U p1))))'
Support contains 21 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 41 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 41 transition count 41
Applied a total of 2 rules in 5 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2023-03-17 00:20:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 00:20:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 00:20:48] [INFO ] Invariant cache hit.
[2023-03-17 00:20:48] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-17 00:20:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 00:20:48] [INFO ] Invariant cache hit.
[2023-03-17 00:20:48] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/61 places, 41/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4651 reset in 362 ms.
Product exploration explored 100000 steps with 4652 reset in 320 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 340 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 329 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
[2023-03-17 00:20:50] [INFO ] Invariant cache hit.
[2023-03-17 00:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 00:20:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 00:20:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 00:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 00:20:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-17 00:20:50] [INFO ] Computed and/alt/rep : 39/77/39 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 00:20:50] [INFO ] Added : 19 causal constraints over 4 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 00:20:50] [INFO ] Invariant cache hit.
[2023-03-17 00:20:50] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 00:20:50] [INFO ] Invariant cache hit.
[2023-03-17 00:20:50] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-17 00:20:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 00:20:50] [INFO ] Invariant cache hit.
[2023-03-17 00:20:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 41/41 places, 41/41 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 532 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 460 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
[2023-03-17 00:20:51] [INFO ] Invariant cache hit.
[2023-03-17 00:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 00:20:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-17 00:20:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 00:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 00:20:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-17 00:20:51] [INFO ] Computed and/alt/rep : 39/77/39 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 00:20:51] [INFO ] Added : 19 causal constraints over 4 iterations in 15 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4648 reset in 245 ms.
Product exploration explored 100000 steps with 4648 reset in 254 ms.
Built C files in :
/tmp/ltsmin12191987474814752809
[2023-03-17 00:20:52] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2023-03-17 00:20:52] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 00:20:52] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2023-03-17 00:20:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 00:20:52] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2023-03-17 00:20:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 00:20:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12191987474814752809
Running compilation step : cd /tmp/ltsmin12191987474814752809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 107 ms.
Running link step : cd /tmp/ltsmin12191987474814752809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12191987474814752809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15876316414370451576.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 00:21:07] [INFO ] Invariant cache hit.
[2023-03-17 00:21:07] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 00:21:07] [INFO ] Invariant cache hit.
[2023-03-17 00:21:07] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-17 00:21:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 00:21:07] [INFO ] Invariant cache hit.
[2023-03-17 00:21:07] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 41/41 places, 41/41 transitions.
Built C files in :
/tmp/ltsmin11696841202899154519
[2023-03-17 00:21:07] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2023-03-17 00:21:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 00:21:07] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2023-03-17 00:21:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 00:21:07] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2023-03-17 00:21:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 00:21:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11696841202899154519
Running compilation step : cd /tmp/ltsmin11696841202899154519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 111 ms.
Running link step : cd /tmp/ltsmin11696841202899154519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11696841202899154519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17807680727741409713.hoa' '--buchi-type=spotba'
LTSmin run took 3067 ms.
FORMULA Referendum-PT-0020-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-PT-0020-LTLCardinality-06 finished in 22778 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&&F(G(p1))) U (F(G(!p2))||((F(G(!p2))||(!p0&&F(G(p1))))&&G(p3))||G((!p0&&F(G(p1)))))))))'
Support contains 61 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2023-03-17 00:21:10] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-17 00:21:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-17 00:21:10] [INFO ] Invariant cache hit.
[2023-03-17 00:21:10] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-17 00:21:10] [INFO ] Invariant cache hit.
[2023-03-17 00:21:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2)), (AND p2 (NOT p1)), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3)))]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p3 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={1} source=3 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={1, 2} source=3 dest: 1}, { cond=(AND p2 (NOT p3) p0), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p3 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p3 p0), acceptance={2} source=3 dest: 3}, { cond=(AND p2 p3 p0), acceptance={0, 2} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40) s0), p3:(GT (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4545 reset in 648 ms.
Product exploration explored 100000 steps with 4545 reset in 589 ms.
Computed a total of 61 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) (NOT p1)), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p2 p3 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p3 p0))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (AND p2 p3 p0))), (X (X (NOT (AND p2 p3 p0))))]
Knowledge based reduction with 22 factoid took 1524 ms. Reduced automaton from 4 states, 21 edges and 4 AP (stutter sensitive) to 4 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2)), (AND p2 (NOT p1)), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3)))]
Incomplete random walk after 10000 steps, including 454 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2023-03-17 00:21:14] [INFO ] Invariant cache hit.
[2023-03-17 00:21:14] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 00:21:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-17 00:21:14] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) (NOT p1)), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p2 p3 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 p2))), (G (NOT (AND p3 (NOT p0) p2))), (G (NOT (AND p3 (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p3 p0))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (AND p2 p3 p0))), (X (X (NOT (AND p2 p3 p0)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p3 p0 p2)), (F (NOT (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0))))), (F (AND p3 p0 (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (F (AND (NOT p3) p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0) p2))), (F (AND (NOT p3) p0 (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 26 factoid took 1938 ms. Reduced automaton from 4 states, 21 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[p2, p2, p2]
Stuttering acceptance computed with spot in 118 ms :[p2, p2, p2]
[2023-03-17 00:21:17] [INFO ] Invariant cache hit.
[2023-03-17 00:21:17] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-17 00:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 00:21:17] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-17 00:21:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 00:21:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned unsat
Proved EG p2
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) (NOT p1)), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p2 p3 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 p2))), (G (NOT (AND p3 (NOT p0) p2))), (G (NOT (AND p3 (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p3 p0))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (AND p2 p3 p0))), (X (X (NOT (AND p2 p3 p0)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p3 p0 p2)), (F (NOT (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0))))), (F (AND p3 p0 (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (F (AND (NOT p3) p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0) p2))), (F (AND (NOT p3) p0 (NOT p2))), (F (NOT (AND (NOT p1) p2))), (G p2)]
Property proved to be false thanks to negative knowledge :(G p2)
Knowledge based reduction with 26 factoid took 758 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0020-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLCardinality-07 finished in 7202 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(F(p0))||G(p1))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 7 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.0 ms
Discarding 54 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 7 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 7 transition count 7
Applied a total of 4 rules in 5 ms. Remains 7 /61 variables (removed 54) and now considering 7/41 (removed 34) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-17 00:21:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 00:21:18] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 00:21:18] [INFO ] Invariant cache hit.
[2023-03-17 00:21:18] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-17 00:21:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 00:21:18] [INFO ] Invariant cache hit.
[2023-03-17 00:21:18] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/61 places, 7/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 7/61 places, 7/41 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s5 0) (EQ s1 1)), p0:(AND (EQ s2 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0020-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-09 finished in 160 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&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(X(!p2)&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0))))))))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 26 transition count 26
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 64 place count 12 transition count 12
Iterating global reduction 1 with 14 rules applied. Total rules applied 78 place count 12 transition count 12
Applied a total of 78 rules in 4 ms. Remains 12 /61 variables (removed 49) and now considering 12/41 (removed 29) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-17 00:21:18] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 00:21:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 00:21:18] [INFO ] Invariant cache hit.
[2023-03-17 00:21:18] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-17 00:21:18] [INFO ] Invariant cache hit.
[2023-03-17 00:21:18] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 12/61 places, 12/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 12/61 places, 12/41 transitions.
Stuttering acceptance computed with spot in 152 ms :[p0, (AND p0 p2), p0, p0, true]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s3 0) (EQ s0 1)), p2:(OR (EQ s1 0) (EQ s5 1)), p0:(OR (EQ s2 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-11 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(X((X(p1) U G(p2)))))))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 24 transition count 24
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 70 place count 8 transition count 8
Iterating global reduction 1 with 16 rules applied. Total rules applied 86 place count 8 transition count 8
Applied a total of 86 rules in 4 ms. Remains 8 /61 variables (removed 53) and now considering 8/41 (removed 33) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-17 00:21:18] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 00:21:18] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 00:21:18] [INFO ] Invariant cache hit.
[2023-03-17 00:21:18] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 00:21:18] [INFO ] Invariant cache hit.
[2023-03-17 00:21:18] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/61 places, 8/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 8/61 places, 8/41 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 6}, { cond=p2, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 3}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s5 1), p2:(EQ s1 1), p1:(OR (EQ s2 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-13 finished in 434 ms.
All properties solved by simple procedures.
Total runtime 74724 ms.

BK_STOP 1679012482203

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Referendum-PT-0020"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is Referendum-PT-0020, 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 r325-tall-167889197300483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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