Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692900723.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CANInsertWithFailure-PT-030, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900723
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K Feb 26 00:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 00:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.6M Mar 5 18:22 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 CANInsertWithFailure-PT-030-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678505985219

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=CANInsertWithFailure-PT-030
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:39:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:39:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:39:47] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2023-03-11 03:39:47] [INFO ] Transformed 2164 places.
[2023-03-11 03:39:47] [INFO ] Transformed 5580 transitions.
[2023-03-11 03:39:47] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2163 transition count 5580
Applied a total of 1 rules in 270 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-11 03:39:47] [INFO ] Computed 32 place invariants in 300 ms
[2023-03-11 03:39:49] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2023-03-11 03:39:49] [INFO ] Invariant cache hit.
[2023-03-11 03:39:50] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:39:51] [INFO ] Implicit Places using invariants and state equation in 2334 ms returned []
Implicit Place search using SMT with State Equation took 3896 ms to find 0 implicit places.
[2023-03-11 03:39:51] [INFO ] Invariant cache hit.
[2023-03-11 03:39:53] [INFO ] Dead Transitions using invariants and state equation in 2390 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2163/2164 places, 5580/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6563 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 59 out of 2163 places after structural reductions.
[2023-03-11 03:39:54] [INFO ] Flatten gal took : 251 ms
[2023-03-11 03:39:54] [INFO ] Flatten gal took : 175 ms
[2023-03-11 03:39:54] [INFO ] Input system was already deterministic with 5580 transitions.
Support contains 55 out of 2163 places (down from 59) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 32) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-11 03:39:55] [INFO ] Invariant cache hit.
[2023-03-11 03:39:56] [INFO ] [Real]Absence check using 30 positive place invariants in 20 ms returned sat
[2023-03-11 03:39:56] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 19 ms returned sat
[2023-03-11 03:39:56] [INFO ] After 701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 03:39:56] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2023-03-11 03:39:56] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-11 03:40:02] [INFO ] After 4893ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2023-03-11 03:40:02] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:40:09] [INFO ] After 7652ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :2 sat :13
[2023-03-11 03:40:15] [INFO ] After 13122ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :13
Attempting to minimize the solution found.
Minimization took 4138 ms.
[2023-03-11 03:40:19] [INFO ] After 23161ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :13
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 6 properties in 417 ms.
Support contains 11 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 863 Post agglomeration using F-continuation condition.Transition count delta: 863
Deduced a syphon composed of 863 places in 2 ms
Reduce places removed 863 places and 0 transitions.
Iterating global reduction 2 with 1726 rules applied. Total rules applied 2146 place count 1090 transition count 4507
Drop transitions removed 805 transitions
Redundant transition composition rules discarded 805 transitions
Iterating global reduction 2 with 805 rules applied. Total rules applied 2951 place count 1090 transition count 3702
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2952 place count 1090 transition count 3701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2953 place count 1089 transition count 3701
Partial Free-agglomeration rule applied 927 times.
Drop transitions removed 927 transitions
Iterating global reduction 3 with 927 rules applied. Total rules applied 3880 place count 1089 transition count 3701
Applied a total of 3880 rules in 1106 ms. Remains 1089 /2163 variables (removed 1074) and now considering 3701/5580 (removed 1879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1107 ms. Remains : 1089/2163 places, 3701/5580 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 205324 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205324 steps, saw 36249 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 3701 rows 1089 cols
[2023-03-11 03:40:24] [INFO ] Computed 32 place invariants in 88 ms
[2023-03-11 03:40:24] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-11 03:40:24] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-11 03:40:24] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 03:40:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-11 03:40:25] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-11 03:40:26] [INFO ] After 1450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 03:40:26] [INFO ] State equation strengthened by 3587 read => feed constraints.
[2023-03-11 03:40:28] [INFO ] After 2225ms SMT Verify possible using 3587 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 03:40:30] [INFO ] After 4112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1277 ms.
[2023-03-11 03:40:32] [INFO ] After 7244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 127 ms.
Support contains 11 out of 1089 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1089/1089 places, 3701/3701 transitions.
Applied a total of 0 rules in 96 ms. Remains 1089 /1089 variables (removed 0) and now considering 3701/3701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 1089/1089 places, 3701/3701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1089/1089 places, 3701/3701 transitions.
Applied a total of 0 rules in 96 ms. Remains 1089 /1089 variables (removed 0) and now considering 3701/3701 (removed 0) transitions.
[2023-03-11 03:40:32] [INFO ] Invariant cache hit.
[2023-03-11 03:40:33] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2023-03-11 03:40:33] [INFO ] Invariant cache hit.
[2023-03-11 03:40:34] [INFO ] State equation strengthened by 3587 read => feed constraints.
[2023-03-11 03:40:51] [INFO ] Implicit Places using invariants and state equation in 17833 ms returned []
Implicit Place search using SMT with State Equation took 18895 ms to find 0 implicit places.
[2023-03-11 03:40:51] [INFO ] Redundant transitions in 316 ms returned []
[2023-03-11 03:40:51] [INFO ] Invariant cache hit.
[2023-03-11 03:40:53] [INFO ] Dead Transitions using invariants and state equation in 1569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20895 ms. Remains : 1089/1089 places, 3701/3701 transitions.
Graph (trivial) has 3480 edges and 1089 vertex of which 954 / 1089 are part of one of the 2 SCC in 5 ms
Free SCC test removed 952 places
Drop transitions removed 2620 transitions
Ensure Unique test removed 920 transitions
Reduce isomorphic transitions removed 3540 transitions.
Graph (complete) has 346 edges and 137 vertex of which 46 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.1 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions removed 29 transitions
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 46 transition count 70
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 93 place count 17 transition count 41
Iterating global reduction 1 with 29 rules applied. Total rules applied 122 place count 17 transition count 41
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 1 with 2 rules applied. Total rules applied 124 place count 16 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 16 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 15 transition count 38
Applied a total of 126 rules in 22 ms. Remains 15 /1089 variables (removed 1074) and now considering 38/3701 (removed 3663) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 38 rows 15 cols
[2023-03-11 03:40:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:40:53] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 03:40:53] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 03:40:53] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 03:40:53] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 122 stabilizing places and 210 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-11 03:40:53] [INFO ] Computed 32 place invariants in 174 ms
[2023-03-11 03:40:54] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2023-03-11 03:40:54] [INFO ] Invariant cache hit.
[2023-03-11 03:40:55] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:40:57] [INFO ] Implicit Places using invariants and state equation in 2194 ms returned []
Implicit Place search using SMT with State Equation took 3196 ms to find 0 implicit places.
[2023-03-11 03:40:57] [INFO ] Invariant cache hit.
[2023-03-11 03:40:59] [INFO ] Dead Transitions using invariants and state equation in 2267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5525 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-00 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:(LEQ 1 s1245)], 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 1 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-00 finished in 5805 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(F(p0))||G(p1))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 81 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-11 03:40:59] [INFO ] Invariant cache hit.
[2023-03-11 03:41:00] [INFO ] Implicit Places using invariants in 850 ms returned []
[2023-03-11 03:41:00] [INFO ] Invariant cache hit.
[2023-03-11 03:41:01] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:41:02] [INFO ] Implicit Places using invariants and state equation in 1949 ms returned []
Implicit Place search using SMT with State Equation took 2820 ms to find 0 implicit places.
[2023-03-11 03:41:02] [INFO ] Invariant cache hit.
[2023-03-11 03:41:04] [INFO ] Dead Transitions using invariants and state equation in 2305 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5211 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ 2 s808) (LEQ 2 s2071)), p0:(GT s1989 s2122)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 546 steps with 0 reset in 22 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-01 finished in 5407 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(X(p0))||G(p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 129 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-11 03:41:05] [INFO ] Invariant cache hit.
[2023-03-11 03:41:05] [INFO ] Implicit Places using invariants in 883 ms returned []
[2023-03-11 03:41:05] [INFO ] Invariant cache hit.
[2023-03-11 03:41:06] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:41:08] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 3096 ms to find 0 implicit places.
[2023-03-11 03:41:08] [INFO ] Invariant cache hit.
[2023-03-11 03:41:10] [INFO ] Dead Transitions using invariants and state equation in 2537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5765 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s1937), p0:(LEQ s1341 s1979)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1170 ms.
Product exploration explored 100000 steps with 33333 reset in 1185 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-03 finished in 8377 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)&&F((p1&&X(G(p2)))))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 2163 transition count 5373
Reduce places removed 207 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 208 rules applied. Total rules applied 415 place count 1956 transition count 5372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 416 place count 1955 transition count 5372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 416 place count 1955 transition count 5371
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 867 Post agglomeration using F-continuation condition.Transition count delta: 867
Deduced a syphon composed of 867 places in 1 ms
Reduce places removed 867 places and 0 transitions.
Iterating global reduction 3 with 1734 rules applied. Total rules applied 2152 place count 1087 transition count 4504
Drop transitions removed 810 transitions
Redundant transition composition rules discarded 810 transitions
Iterating global reduction 3 with 810 rules applied. Total rules applied 2962 place count 1087 transition count 3694
Applied a total of 2962 rules in 583 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1087 cols
[2023-03-11 03:41:13] [INFO ] Computed 32 place invariants in 50 ms
[2023-03-11 03:41:14] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-03-11 03:41:14] [INFO ] Invariant cache hit.
[2023-03-11 03:41:15] [INFO ] State equation strengthened by 2665 read => feed constraints.
[2023-03-11 03:41:20] [INFO ] Implicit Places using invariants and state equation in 6007 ms returned []
Implicit Place search using SMT with State Equation took 6558 ms to find 0 implicit places.
[2023-03-11 03:41:20] [INFO ] Redundant transitions in 154 ms returned []
[2023-03-11 03:41:20] [INFO ] Invariant cache hit.
[2023-03-11 03:41:22] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1087/2163 places, 3694/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8755 ms. Remains : 1087/2163 places, 3694/5580 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-04 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=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s156 s930), p1:(LEQ 1 s121), p2:(LEQ s275 s483)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1018 steps with 6 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-04 finished in 8984 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&&F(p1)))||X(F(p2))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 81 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-11 03:41:22] [INFO ] Computed 32 place invariants in 133 ms
[2023-03-11 03:41:23] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-11 03:41:23] [INFO ] Invariant cache hit.
[2023-03-11 03:41:24] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:41:25] [INFO ] Implicit Places using invariants and state equation in 2429 ms returned []
Implicit Place search using SMT with State Equation took 3389 ms to find 0 implicit places.
[2023-03-11 03:41:25] [INFO ] Invariant cache hit.
[2023-03-11 03:41:28] [INFO ] Dead Transitions using invariants and state equation in 2293 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5765 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s1386 s1524), p1:(GT s1569 s1774), p2:(LEQ 1 s1201)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 679 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-05 finished in 5920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 118 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-11 03:41:28] [INFO ] Invariant cache hit.
[2023-03-11 03:41:29] [INFO ] Implicit Places using invariants in 712 ms returned []
[2023-03-11 03:41:29] [INFO ] Invariant cache hit.
[2023-03-11 03:41:29] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:41:30] [INFO ] Implicit Places using invariants and state equation in 1781 ms returned []
Implicit Place search using SMT with State Equation took 2495 ms to find 0 implicit places.
[2023-03-11 03:41:30] [INFO ] Invariant cache hit.
[2023-03-11 03:41:32] [INFO ] Dead Transitions using invariants and state equation in 2119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4738 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GT 1 s1877) (GT 3 s1508)), p1:(LEQ s399 s1611)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1312 ms.
Product exploration explored 100000 steps with 50000 reset in 1244 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 175 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-06 finished in 7629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 77 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-11 03:41:35] [INFO ] Invariant cache hit.
[2023-03-11 03:41:36] [INFO ] Implicit Places using invariants in 950 ms returned []
[2023-03-11 03:41:36] [INFO ] Invariant cache hit.
[2023-03-11 03:41:37] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:41:39] [INFO ] Implicit Places using invariants and state equation in 2245 ms returned []
Implicit Place search using SMT with State Equation took 3201 ms to find 0 implicit places.
[2023-03-11 03:41:39] [INFO ] Invariant cache hit.
[2023-03-11 03:41:41] [INFO ] Dead Transitions using invariants and state equation in 2113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5393 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-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:(GT s2016 s256)], 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]]
Stuttering criterion allowed to conclude after 945 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-08 finished in 5511 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((G(!p0)||(!p0&&F(p1))))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 2163 transition count 5373
Reduce places removed 207 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 208 rules applied. Total rules applied 415 place count 1956 transition count 5372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 416 place count 1955 transition count 5372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 416 place count 1955 transition count 5371
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 867 Post agglomeration using F-continuation condition.Transition count delta: 867
Deduced a syphon composed of 867 places in 2 ms
Reduce places removed 867 places and 0 transitions.
Iterating global reduction 3 with 1734 rules applied. Total rules applied 2152 place count 1087 transition count 4504
Drop transitions removed 810 transitions
Redundant transition composition rules discarded 810 transitions
Iterating global reduction 3 with 810 rules applied. Total rules applied 2962 place count 1087 transition count 3694
Applied a total of 2962 rules in 448 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1087 cols
[2023-03-11 03:41:41] [INFO ] Computed 32 place invariants in 34 ms
[2023-03-11 03:41:42] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-11 03:41:42] [INFO ] Invariant cache hit.
[2023-03-11 03:41:43] [INFO ] State equation strengthened by 2665 read => feed constraints.
[2023-03-11 03:41:47] [INFO ] Implicit Places using invariants and state equation in 5515 ms returned []
Implicit Place search using SMT with State Equation took 6002 ms to find 0 implicit places.
[2023-03-11 03:41:48] [INFO ] Redundant transitions in 236 ms returned []
[2023-03-11 03:41:48] [INFO ] Invariant cache hit.
[2023-03-11 03:41:49] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1087/2163 places, 3694/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8075 ms. Remains : 1087/2163 places, 3694/5580 transitions.
Stuttering acceptance computed with spot in 137 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 2 s964), p0:(OR (LEQ s354 s64) (LEQ s91 s877))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 183 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-09 finished in 8234 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||G(p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 419 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-11 03:41:50] [INFO ] Computed 32 place invariants in 92 ms
[2023-03-11 03:41:50] [INFO ] Implicit Places using invariants in 683 ms returned []
[2023-03-11 03:41:50] [INFO ] Invariant cache hit.
[2023-03-11 03:41:51] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-11 03:41:55] [INFO ] Implicit Places using invariants and state equation in 5101 ms returned []
Implicit Place search using SMT with State Equation took 5796 ms to find 0 implicit places.
[2023-03-11 03:41:55] [INFO ] Redundant transitions in 163 ms returned []
[2023-03-11 03:41:55] [INFO ] Invariant cache hit.
[2023-03-11 03:41:57] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7797 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(GT 1 s655), p0:(GT s214 s572)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1824 steps with 11 reset in 14 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-11 finished in 7898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||G(p2)))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 82 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-11 03:41:57] [INFO ] Computed 32 place invariants in 113 ms
[2023-03-11 03:41:58] [INFO ] Implicit Places using invariants in 865 ms returned []
[2023-03-11 03:41:58] [INFO ] Invariant cache hit.
[2023-03-11 03:41:59] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:42:00] [INFO ] Implicit Places using invariants and state equation in 1839 ms returned []
Implicit Place search using SMT with State Equation took 2706 ms to find 0 implicit places.
[2023-03-11 03:42:00] [INFO ] Invariant cache hit.
[2023-03-11 03:42:02] [INFO ] Dead Transitions using invariants and state equation in 2097 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4886 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s289 s1199), p0:(LEQ 2 s1848), p2:(LEQ 1 s1735)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1391 ms.
Product exploration explored 100000 steps with 50000 reset in 1611 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0) (NOT p2))
Knowledge based reduction with 15 factoid took 443 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-12 finished in 8496 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))&&(G(p1)||X(X(F(!p1))))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 107 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-11 03:42:06] [INFO ] Invariant cache hit.
[2023-03-11 03:42:07] [INFO ] Implicit Places using invariants in 924 ms returned []
[2023-03-11 03:42:07] [INFO ] Invariant cache hit.
[2023-03-11 03:42:07] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:42:09] [INFO ] Implicit Places using invariants and state equation in 2018 ms returned []
Implicit Place search using SMT with State Equation took 2957 ms to find 0 implicit places.
[2023-03-11 03:42:09] [INFO ] Invariant cache hit.
[2023-03-11 03:42:11] [INFO ] Dead Transitions using invariants and state equation in 2302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5368 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (OR (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(LEQ s326 s264), p1:(GT 3 s1293)], 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14243 steps with 19 reset in 111 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-13 finished in 5721 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) U (p1&&X((p1 U ((p2 U (p3||G(p2)))||G(p1))))))))'
Support contains 7 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 116 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-11 03:42:11] [INFO ] Invariant cache hit.
[2023-03-11 03:42:12] [INFO ] Implicit Places using invariants in 951 ms returned []
[2023-03-11 03:42:12] [INFO ] Invariant cache hit.
[2023-03-11 03:42:14] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:42:20] [INFO ] Implicit Places using invariants and state equation in 7735 ms returned []
Implicit Place search using SMT with State Equation took 8693 ms to find 0 implicit places.
[2023-03-11 03:42:20] [INFO ] Invariant cache hit.
[2023-03-11 03:42:22] [INFO ] Dead Transitions using invariants and state equation in 2401 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11211 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 396 ms :[(NOT p1), (NOT p1), true, (NOT p0), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} 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 p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 5}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=5 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={1} source=7 dest: 5}, { cond=(AND p1 p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 2 s1549), p0:(LEQ s1823 s232), p3:(AND (GT s1336 s1718) (GT s2161 s1662)), p2:(GT s2161 s1662)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7433 steps with 10 reset in 57 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-14 finished in 11723 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)))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 111 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-11 03:42:23] [INFO ] Invariant cache hit.
[2023-03-11 03:42:24] [INFO ] Implicit Places using invariants in 729 ms returned []
[2023-03-11 03:42:24] [INFO ] Invariant cache hit.
[2023-03-11 03:42:25] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:42:26] [INFO ] Implicit Places using invariants and state equation in 2283 ms returned []
Implicit Place search using SMT with State Equation took 3029 ms to find 0 implicit places.
[2023-03-11 03:42:26] [INFO ] Invariant cache hit.
[2023-03-11 03:42:28] [INFO ] Dead Transitions using invariants and state equation in 2256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5397 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(LEQ s706 s761), p1:(GT 3 s1998)], 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 50000 reset in 1440 ms.
Product exploration explored 100000 steps with 50000 reset in 1413 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 198 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-15 finished in 8585 ms.
All properties solved by simple procedures.
Total runtime 165156 ms.
ITS solved all properties within timeout

BK_STOP 1678506152207

--------------------
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="CANInsertWithFailure-PT-030"
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 CANInsertWithFailure-PT-030, 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 r039-tajo-167813692900723"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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