Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662362300447.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is RefineWMG-PT-015016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362300447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 04:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 13 04:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 13 04:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 04:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 35K May 18 16:43 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 RefineWMG-PT-015016-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-015016-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716863325544

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-015016
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:28:47] [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]
[2024-05-28 02:28:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:28:47] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2024-05-28 02:28:47] [INFO ] Transformed 79 places.
[2024-05-28 02:28:47] [INFO ] Transformed 63 transitions.
[2024-05-28 02:28:47] [INFO ] Parsed PT model containing 79 places and 63 transitions and 188 arcs in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA RefineWMG-PT-015016-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015016-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015016-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015016-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015016-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 10 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:28:47] [INFO ] Computed 32 invariants in 12 ms
[2024-05-28 02:28:47] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
[2024-05-28 02:28:47] [INFO ] Invariant cache hit.
[2024-05-28 02:28:47] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 02:28:47] [INFO ] Invariant cache hit.
[2024-05-28 02:28:47] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-28 02:28:47] [INFO ] Invariant cache hit.
[2024-05-28 02:28:47] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 79/79 places, 63/63 transitions.
Support contains 28 out of 79 places after structural reductions.
[2024-05-28 02:28:48] [INFO ] Flatten gal took : 22 ms
[2024-05-28 02:28:48] [INFO ] Flatten gal took : 10 ms
[2024-05-28 02:28:48] [INFO ] Input system was already deterministic with 63 transitions.
Support contains 27 out of 79 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 23) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-28 02:28:48] [INFO ] Invariant cache hit.
[2024-05-28 02:28:48] [INFO ] [Real]Absence check using 32 positive place invariants in 18 ms returned sat
[2024-05-28 02:28:48] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-28 02:28:48] [INFO ] [Nat]Absence check using 32 positive place invariants in 28 ms returned sat
[2024-05-28 02:28:49] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-28 02:28:49] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-28 02:28:49] [INFO ] After 618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Finished Parikh walk after 463 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=154 )
Parikh walk visited 11 properties in 60 ms.
FORMULA RefineWMG-PT-015016-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RefineWMG-PT-015016-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 42 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 2 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 56 place count 23 transition count 22
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 10 rules applied. Total rules applied 66 place count 23 transition count 12
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 76 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 11 transition count 10
Applied a total of 80 rules in 13 ms. Remains 11 /79 variables (removed 68) and now considering 10/63 (removed 53) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-05-28 02:28:49] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 02:28:49] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-28 02:28:49] [INFO ] Invariant cache hit.
[2024-05-28 02:28:49] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:28:49] [INFO ] Invariant cache hit.
[2024-05-28 02:28:49] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-28 02:28:49] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:28:49] [INFO ] Invariant cache hit.
[2024-05-28 02:28:49] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/79 places, 10/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 11/79 places, 10/63 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-015016-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 2 s9), p1:(GT s6 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9974 reset in 306 ms.
Product exploration explored 100000 steps with 9898 reset in 149 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:28:50] [INFO ] Invariant cache hit.
[2024-05-28 02:28:50] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 02:28:50] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:28:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 30 ms returned sat
[2024-05-28 02:28:50] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 02:28:50] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-28 02:28:50] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 76 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-28 02:28:51] [INFO ] Invariant cache hit.
[2024-05-28 02:28:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-28 02:28:51] [INFO ] Invariant cache hit.
[2024-05-28 02:28:51] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 02:28:51] [INFO ] Invariant cache hit.
[2024-05-28 02:28:51] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-28 02:28:51] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:28:51] [INFO ] Invariant cache hit.
[2024-05-28 02:28:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 11/11 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:28:51] [INFO ] Invariant cache hit.
[2024-05-28 02:28:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 02:28:51] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:28:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-28 02:28:51] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 02:28:51] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-28 02:28:51] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 76 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9869 reset in 104 ms.
Product exploration explored 100000 steps with 9956 reset in 196 ms.
Built C files in :
/tmp/ltsmin2777565236992760791
[2024-05-28 02:28:52] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-28 02:28:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:28:52] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-28 02:28:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:28:52] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-28 02:28:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:28:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2777565236992760791
Running compilation step : cd /tmp/ltsmin2777565236992760791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 155 ms.
Running link step : cd /tmp/ltsmin2777565236992760791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2777565236992760791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9805830598770562882.hoa' '--buchi-type=spotba'
LTSmin run took 352 ms.
FORMULA RefineWMG-PT-015016-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-015016-LTLCardinality-01 finished in 3524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:28:53] [INFO ] Computed 32 invariants in 2 ms
[2024-05-28 02:28:53] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2024-05-28 02:28:53] [INFO ] Invariant cache hit.
[2024-05-28 02:28:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 02:28:53] [INFO ] Invariant cache hit.
[2024-05-28 02:28:53] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-28 02:28:53] [INFO ] Invariant cache hit.
[2024-05-28 02:28:53] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015016-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s21) (LEQ 1 s21))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-015016-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-015016-LTLCardinality-02 finished in 670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 52 place count 27 transition count 25
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 27 transition count 17
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 19 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 68 place count 19 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 17 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 16 transition count 14
Applied a total of 74 rules in 9 ms. Remains 16 /79 variables (removed 63) and now considering 14/63 (removed 49) transitions.
// Phase 1: matrix 14 rows 16 cols
[2024-05-28 02:28:53] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 02:28:53] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2024-05-28 02:28:53] [INFO ] Invariant cache hit.
[2024-05-28 02:28:53] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 02:28:53] [INFO ] Invariant cache hit.
[2024-05-28 02:28:53] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-28 02:28:53] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:28:53] [INFO ] Invariant cache hit.
[2024-05-28 02:28:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/79 places, 14/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 16/79 places, 14/63 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015016-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s14 s12), p1:(OR (LEQ 3 s5) (LEQ s9 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015016-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-LTLCardinality-03 finished in 383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:28:54] [INFO ] Computed 32 invariants in 4 ms
[2024-05-28 02:28:54] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2024-05-28 02:28:54] [INFO ] Invariant cache hit.
[2024-05-28 02:28:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 02:28:54] [INFO ] Invariant cache hit.
[2024-05-28 02:28:54] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-28 02:28:54] [INFO ] Invariant cache hit.
[2024-05-28 02:28:54] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-015016-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s63), p1:(LEQ 3 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1524 reset in 236 ms.
Product exploration explored 100000 steps with 1480 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 02:28:55] [INFO ] Invariant cache hit.
[2024-05-28 02:28:55] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-28 02:28:55] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 02:28:55] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned sat
[2024-05-28 02:28:55] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 02:28:55] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-28 02:28:55] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 473 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=157 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 42 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 6 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 56 place count 23 transition count 22
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 10 rules applied. Total rules applied 66 place count 23 transition count 12
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 76 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 10 transition count 9
Applied a total of 82 rules in 16 ms. Remains 10 /79 variables (removed 69) and now considering 9/63 (removed 54) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-28 02:28:56] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 02:28:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-28 02:28:56] [INFO ] Invariant cache hit.
[2024-05-28 02:28:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 02:28:56] [INFO ] Invariant cache hit.
[2024-05-28 02:28:56] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-28 02:28:56] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:28:56] [INFO ] Invariant cache hit.
[2024-05-28 02:28:56] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/79 places, 9/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 10/79 places, 9/63 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 7 factoid took 214 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 2) seen :1
Finished Best-First random walk after 391 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=391 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F p0), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 12860 reset in 75 ms.
Product exploration explored 100000 steps with 12687 reset in 95 ms.
Built C files in :
/tmp/ltsmin15477984036431989289
[2024-05-28 02:28:57] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-28 02:28:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:28:57] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-28 02:28:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:28:57] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-28 02:28:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:28:57] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15477984036431989289
Running compilation step : cd /tmp/ltsmin15477984036431989289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin15477984036431989289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15477984036431989289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12126273085264408833.hoa' '--buchi-type=spotba'
LTSmin run took 151 ms.
FORMULA RefineWMG-PT-015016-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-015016-LTLCardinality-04 finished in 3970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 43 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 59 place count 21 transition count 21
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 12 rules applied. Total rules applied 71 place count 21 transition count 9
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 83 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 83 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 7 transition count 7
Applied a total of 87 rules in 6 ms. Remains 7 /79 variables (removed 72) and now considering 7/63 (removed 56) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-28 02:28:58] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 02:28:58] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2024-05-28 02:28:58] [INFO ] Invariant cache hit.
[2024-05-28 02:28:58] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 02:28:58] [INFO ] Invariant cache hit.
[2024-05-28 02:28:58] [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.
[2024-05-28 02:28:58] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:28:58] [INFO ] Invariant cache hit.
[2024-05-28 02:28:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/79 places, 7/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 7/79 places, 7/63 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-015016-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 72 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015016-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-LTLCardinality-07 finished in 153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:28:58] [INFO ] Computed 32 invariants in 1 ms
[2024-05-28 02:28:58] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2024-05-28 02:28:58] [INFO ] Invariant cache hit.
[2024-05-28 02:28:58] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 02:28:58] [INFO ] Invariant cache hit.
[2024-05-28 02:28:58] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-28 02:28:58] [INFO ] Invariant cache hit.
[2024-05-28 02:28:58] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015016-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s71)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-015016-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-015016-LTLCardinality-08 finished in 560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G((p1&&F(p2))))))'
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:28:58] [INFO ] Invariant cache hit.
[2024-05-28 02:28:58] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-28 02:28:58] [INFO ] Invariant cache hit.
[2024-05-28 02:28:58] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 02:28:58] [INFO ] Invariant cache hit.
[2024-05-28 02:28:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-28 02:28:59] [INFO ] Invariant cache hit.
[2024-05-28 02:28:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p0)), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-015016-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s59 s14), p0:(LEQ s5 s6), p2:(LEQ s24 s78)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 678 reset in 273 ms.
Stack based approach found an accepted trace after 14290 steps with 96 reset with depth 201 and stack size 198 in 54 ms.
FORMULA RefineWMG-PT-015016-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015016-LTLCardinality-09 finished in 893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(G(p2))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:28:59] [INFO ] Invariant cache hit.
[2024-05-28 02:28:59] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2024-05-28 02:28:59] [INFO ] Invariant cache hit.
[2024-05-28 02:28:59] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 02:28:59] [INFO ] Invariant cache hit.
[2024-05-28 02:28:59] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-28 02:28:59] [INFO ] Invariant cache hit.
[2024-05-28 02:28:59] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-015016-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(OR (LEQ s69 s17) (LEQ s14 s76)), p1:(LEQ s14 s76), p0:(LEQ s69 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 280 ms.
Product exploration explored 100000 steps with 0 reset in 324 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2)))), (X (AND p1 p2)), (X (X p2)), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 119 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p2)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1469446 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :{}
Probabilistic random walk after 1469446 steps, saw 1194301 distinct states, run finished after 3002 ms. (steps per millisecond=489 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:29:03] [INFO ] Invariant cache hit.
[2024-05-28 02:29:03] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:29:03] [INFO ] [Nat]Absence check using 32 positive place invariants in 3 ms returned sat
[2024-05-28 02:29:04] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 02:29:04] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-28 02:29:04] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 400 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=80 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2)))), (X (AND p1 p2)), (X (X p2)), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 10 factoid took 256 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-015016-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-015016-LTLCardinality-12 finished in 4524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X((F(G(p2))&&p1))))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:29:04] [INFO ] Invariant cache hit.
[2024-05-28 02:29:04] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2024-05-28 02:29:04] [INFO ] Invariant cache hit.
[2024-05-28 02:29:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 02:29:04] [INFO ] Invariant cache hit.
[2024-05-28 02:29:04] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-28 02:29:04] [INFO ] Invariant cache hit.
[2024-05-28 02:29:04] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-015016-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s60), p1:(AND (LEQ 3 s40) (LEQ 2 s54)), p2:(LEQ 2 s54)], nbAcceptance=1, 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 0 reset in 276 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 0 ms.
FORMULA RefineWMG-PT-015016-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015016-LTLCardinality-14 finished in 642 ms.
All properties solved by simple procedures.
Total runtime 17618 ms.

BK_STOP 1716863346011

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="RefineWMG-PT-015016"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is RefineWMG-PT-015016, 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 r329-tall-171662362300447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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