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.r327-tall-167889199700515.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Referendum-PT-0500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199700515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 496K Feb 26 19:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Feb 26 19:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 255K Feb 26 18:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 18:40 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 257K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 881K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 80K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 404K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.4M Feb 26 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.1M Feb 26 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 511K Feb 26 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.5M Feb 26 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 40K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 93K 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 571K 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-0500-LTLCardinality-00
FORMULA_NAME Referendum-PT-0500-LTLCardinality-01
FORMULA_NAME Referendum-PT-0500-LTLCardinality-02
FORMULA_NAME Referendum-PT-0500-LTLCardinality-03
FORMULA_NAME Referendum-PT-0500-LTLCardinality-04
FORMULA_NAME Referendum-PT-0500-LTLCardinality-05
FORMULA_NAME Referendum-PT-0500-LTLCardinality-06
FORMULA_NAME Referendum-PT-0500-LTLCardinality-07
FORMULA_NAME Referendum-PT-0500-LTLCardinality-08
FORMULA_NAME Referendum-PT-0500-LTLCardinality-09
FORMULA_NAME Referendum-PT-0500-LTLCardinality-10
FORMULA_NAME Referendum-PT-0500-LTLCardinality-11
FORMULA_NAME Referendum-PT-0500-LTLCardinality-12
FORMULA_NAME Referendum-PT-0500-LTLCardinality-13
FORMULA_NAME Referendum-PT-0500-LTLCardinality-14
FORMULA_NAME Referendum-PT-0500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679050824015

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 11:00:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 11:00:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 11:00:25] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-17 11:00:25] [INFO ] Transformed 1501 places.
[2023-03-17 11:00:25] [INFO ] Transformed 1001 transitions.
[2023-03-17 11:00:25] [INFO ] Found NUPN structural information;
[2023-03-17 11:00:25] [INFO ] Parsed PT model containing 1501 places and 1001 transitions and 2501 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 99 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0500-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Applied a total of 0 rules in 26 ms. Remains 1501 /1501 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1501 cols
[2023-03-17 11:00:26] [INFO ] Computed 500 place invariants in 29 ms
[2023-03-17 11:00:26] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-17 11:00:26] [INFO ] Invariant cache hit.
[2023-03-17 11:00:27] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2023-03-17 11:00:27] [INFO ] Invariant cache hit.
[2023-03-17 11:00:28] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2112 ms. Remains : 1501/1501 places, 1001/1001 transitions.
Support contains 1501 out of 1501 places after structural reductions.
[2023-03-17 11:00:28] [INFO ] Flatten gal took : 154 ms
[2023-03-17 11:00:28] [INFO ] Flatten gal took : 72 ms
[2023-03-17 11:00:28] [INFO ] Input system was already deterministic with 1001 transitions.
Finished random walk after 3234 steps, including 6 resets, run visited all 15 properties in 259 ms. (steps per millisecond=12 )
Computed a total of 1501 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1501 transition count 1001
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' '!(X(X(G(p0))))'
Support contains 500 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 1500 place count 501 transition count 501
Applied a total of 1500 rules in 27 ms. Remains 501 /1501 variables (removed 1000) and now considering 501/1001 (removed 500) transitions.
// Phase 1: matrix 501 rows 501 cols
[2023-03-17 11:00:29] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-17 11:00:29] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-17 11:00:29] [INFO ] Invariant cache hit.
[2023-03-17 11:00:29] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-17 11:00:29] [INFO ] Invariant cache hit.
[2023-03-17 11:00:29] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/1501 places, 501/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 501/1501 places, 501/1001 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Referendum-PT-0500-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-01 finished in 783 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((X(p1)&&p0))&&X(p2)))'
Support contains 1501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Applied a total of 0 rules in 11 ms. Remains 1501 /1501 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1501 cols
[2023-03-17 11:00:30] [INFO ] Computed 500 place invariants in 5 ms
[2023-03-17 11:00:30] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-17 11:00:30] [INFO ] Invariant cache hit.
[2023-03-17 11:00:31] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
[2023-03-17 11:00:31] [INFO ] Invariant cache hit.
[2023-03-17 11:00:31] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1658 ms. Remains : 1501/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ 2 (ADD s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 17886 reset in 9381 ms.
Product exploration explored 100000 steps with 18020 reset in 9379 ms.
Computed a total of 1501 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1501 transition count 1001
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 p2) (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 470 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 506 steps, including 1 resets, run visited all 3 properties in 53 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 573 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-17 11:00:52] [INFO ] Invariant cache hit.
[2023-03-17 11:00:58] [INFO ] [Real]Absence check using 500 positive place invariants in 162 ms returned sat
[2023-03-17 11:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:00:59] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2023-03-17 11:00:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:01:04] [INFO ] [Nat]Absence check using 500 positive place invariants in 261 ms returned unsat
Proved EG (NOT p0)
[2023-03-17 11:01:04] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 12 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-02 finished in 36476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 500 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 1001 transition count 1001
Applied a total of 500 rules in 53 ms. Remains 1001 /1501 variables (removed 500) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2023-03-17 11:01:06] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-17 11:01:06] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-17 11:01:06] [INFO ] Invariant cache hit.
[2023-03-17 11:01:07] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-17 11:01:07] [INFO ] Invariant cache hit.
[2023-03-17 11:01:07] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1501 places, 1001/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1022 ms. Remains : 1001/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0500-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-03 finished in 1115 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||X(X(!p1))))))'
Support contains 1001 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 1001 transition count 1001
Applied a total of 500 rules in 13 ms. Remains 1001 /1501 variables (removed 500) and now considering 1001/1001 (removed 0) transitions.
[2023-03-17 11:01:07] [INFO ] Invariant cache hit.
[2023-03-17 11:01:07] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-17 11:01:07] [INFO ] Invariant cache hit.
[2023-03-17 11:01:08] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-17 11:01:08] [INFO ] Invariant cache hit.
[2023-03-17 11:01:08] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1501 places, 1001/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 958 ms. Remains : 1001/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 s528 s...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 22202 reset in 7513 ms.
Product exploration explored 100000 steps with 22156 reset in 7742 ms.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
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 p0 p1), (X (NOT p0)), (X (X (NOT p0))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-04 finished in 16715 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' '!(((p0 U X(p1))||G(p2)))'
Support contains 1501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Applied a total of 0 rules in 10 ms. Remains 1501 /1501 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1501 cols
[2023-03-17 11:01:24] [INFO ] Computed 500 place invariants in 11 ms
[2023-03-17 11:01:24] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-17 11:01:24] [INFO ] Invariant cache hit.
[2023-03-17 11:01:25] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
[2023-03-17 11:01:25] [INFO ] Invariant cache hit.
[2023-03-17 11:01:26] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1655 ms. Remains : 1501/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}]], initial=1, aps=[p0:(LEQ (ADD s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1023 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-0500-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-05 finished in 1951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F((p0&&G(p1)))))))))'
Support contains 1500 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Applied a total of 0 rules in 9 ms. Remains 1501 /1501 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2023-03-17 11:01:26] [INFO ] Invariant cache hit.
[2023-03-17 11:01:26] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-17 11:01:26] [INFO ] Invariant cache hit.
[2023-03-17 11:01:27] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
[2023-03-17 11:01:27] [INFO ] Invariant cache hit.
[2023-03-17 11:01:28] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1679 ms. Remains : 1501/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ (ADD s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 s528 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 501 steps with 0 reset in 58 ms.
FORMULA Referendum-PT-0500-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-07 finished in 2049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 3 are kept as prefixes of interest. Removing 1498 places using SCC suffix rule.5 ms
Discarding 1498 places :
Also discarding 996 output transitions
Drop transitions removed 996 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 3 transition count 3
Applied a total of 3 rules in 15 ms. Remains 3 /1501 variables (removed 1498) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 11:01:28] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 11:01:28] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 11:01:28] [INFO ] Invariant cache hit.
[2023-03-17 11:01:28] [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 11:01:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 11:01:28] [INFO ] Invariant cache hit.
[2023-03-17 11:01:28] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1501 places, 3/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 3/1501 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-09 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:(OR (AND (EQ s2 0) (EQ s0 1)) (AND (EQ s1 0) (EQ s0 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0500-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-09 finished in 176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 3 are kept as prefixes of interest. Removing 1498 places using SCC suffix rule.4 ms
Discarding 1498 places :
Also discarding 998 output transitions
Drop transitions removed 998 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 3 transition count 3
Applied a total of 2 rules in 12 ms. Remains 3 /1501 variables (removed 1498) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 11:01:28] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 11:01:28] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-17 11:01:28] [INFO ] Invariant cache hit.
[2023-03-17 11:01:28] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-17 11:01:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 11:01:28] [INFO ] Invariant cache hit.
[2023-03-17 11:01:28] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1501 places, 3/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 3/1501 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 39921 reset in 109 ms.
Product exploration explored 100000 steps with 39995 reset in 101 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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 p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-10 finished in 502 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)||X((X(p2)||p1))))'
Support contains 4 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 998 places and 0 transitions.
Ensure Unique test removed 498 transitions
Reduce isomorphic transitions removed 498 transitions.
Iterating post reduction 0 with 1496 rules applied. Total rules applied 1496 place count 503 transition count 503
Discarding 495 places :
Symmetric choice reduction at 1 with 495 rule applications. Total rules 1991 place count 8 transition count 8
Iterating global reduction 1 with 495 rules applied. Total rules applied 2486 place count 8 transition count 8
Applied a total of 2486 rules in 22 ms. Remains 8 /1501 variables (removed 1493) and now considering 8/1001 (removed 993) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-17 11:01:29] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 11:01:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 11:01:29] [INFO ] Invariant cache hit.
[2023-03-17 11:01:29] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-17 11:01:29] [INFO ] Invariant cache hit.
[2023-03-17 11:01:29] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/1501 places, 8/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 8/1501 places, 8/1001 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(OR (EQ s2 0) (EQ s4 1)), p2:(OR (EQ s2 0) (EQ s4 1) (EQ s7 0) (EQ s1 1)), p0:(AND (EQ s1 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
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 p1 p2 (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 10 factoid took 133 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-12 finished in 648 ms.
All properties solved by simple procedures.
Total runtime 64380 ms.
ITS solved all properties within timeout

BK_STOP 1679050891050

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-0500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Referendum-PT-0500, 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 r327-tall-167889199700515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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