fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r167-tall-167838852500059
Last Updated
May 14, 2023

About the Execution of LoLa+red for Echo-PT-d02r11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
755.920 1765551.00 1792382.00 4625.60 FFTFTFFFFF?T?TTF normal

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.r167-tall-167838852500059.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 Echo-PT-d02r11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852500059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 908K
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 469K 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 Echo-PT-d02r11-LTLCardinality-00
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-01
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-02
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-03
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-04
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-05
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-06
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-07
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-08
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-09
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-10
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-11
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-12
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-13
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-14
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678434477856

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=Echo-PT-d02r11
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 07:47:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 07:47:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 07:47:59] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-10 07:47:59] [INFO ] Transformed 1119 places.
[2023-03-10 07:47:59] [INFO ] Transformed 874 transitions.
[2023-03-10 07:47:59] [INFO ] Found NUPN structural information;
[2023-03-10 07:47:59] [INFO ] Parsed PT model containing 1119 places and 874 transitions and 4996 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Echo-PT-d02r11-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d02r11-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 874/874 transitions.
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 1001 transition count 874
Applied a total of 118 rules in 89 ms. Remains 1001 /1119 variables (removed 118) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 1001 cols
[2023-03-10 07:47:59] [INFO ] Computed 443 place invariants in 344 ms
[2023-03-10 07:48:03] [INFO ] Implicit Places using invariants in 3684 ms returned []
[2023-03-10 07:48:03] [INFO ] Invariant cache hit.
[2023-03-10 07:50:43] [INFO ] Performed 13/1001 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 07:50:43] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 07:50:43] [INFO ] Implicit Places using invariants and state equation in 160023 ms returned []
Implicit Place search using SMT with State Equation took 163731 ms to find 0 implicit places.
[2023-03-10 07:50:43] [INFO ] Invariant cache hit.
[2023-03-10 07:50:45] [INFO ] Dead Transitions using invariants and state equation in 1740 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1119 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165563 ms. Remains : 1001/1119 places, 874/874 transitions.
Support contains 27 out of 1001 places after structural reductions.
[2023-03-10 07:50:45] [INFO ] Flatten gal took : 111 ms
[2023-03-10 07:50:45] [INFO ] Flatten gal took : 71 ms
[2023-03-10 07:50:45] [INFO ] Input system was already deterministic with 874 transitions.
Finished random walk after 2816 steps, including 11 resets, run visited all 14 properties in 73 ms. (steps per millisecond=38 )
FORMULA Echo-PT-d02r11-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1001 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 874
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)&&(X(p1)||G(p2))))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 998 transition count 874
Applied a total of 3 rules in 29 ms. Remains 998 /1001 variables (removed 3) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2023-03-10 07:50:46] [INFO ] Computed 440 place invariants in 205 ms
[2023-03-10 07:50:49] [INFO ] Implicit Places using invariants in 3648 ms returned []
[2023-03-10 07:50:49] [INFO ] Invariant cache hit.
[2023-03-10 07:53:29] [INFO ] Performed 675/998 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2023-03-10 07:53:29] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2023-03-10 07:53:29] [INFO ] Implicit Places using invariants and state equation in 160016 ms returned []
Implicit Place search using SMT with State Equation took 163667 ms to find 0 implicit places.
[2023-03-10 07:53:29] [INFO ] Invariant cache hit.
[2023-03-10 07:53:31] [INFO ] Dead Transitions using invariants and state equation in 1563 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 998/1001 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165260 ms. Remains : 998/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 408 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 7}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 p2), acceptance={} source=6 dest: 2}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=4, aps=[p0:(OR (EQ s357 0) (EQ s498 1)), p1:(OR (EQ s562 0) (EQ s553 1)), p2:(AND (EQ s553 0) (EQ s562 1))], 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 7 ms.
FORMULA Echo-PT-d02r11-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLCardinality-00 finished in 165739 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((X(p0)&&(F(p2)||p1))))'
Support contains 8 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 999 transition count 874
Applied a total of 2 rules in 24 ms. Remains 999 /1001 variables (removed 2) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 999 cols
[2023-03-10 07:53:31] [INFO ] Computed 441 place invariants in 203 ms
[2023-03-10 07:53:34] [INFO ] Implicit Places using invariants in 3354 ms returned []
[2023-03-10 07:53:34] [INFO ] Invariant cache hit.
[2023-03-10 07:56:14] [INFO ] Performed 198/999 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 07:56:14] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 07:56:14] [INFO ] Implicit Places using invariants and state equation in 160022 ms returned []
Implicit Place search using SMT with State Equation took 163378 ms to find 0 implicit places.
[2023-03-10 07:56:14] [INFO ] Invariant cache hit.
[2023-03-10 07:56:16] [INFO ] Dead Transitions using invariants and state equation in 1684 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 999/1001 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165088 ms. Remains : 999/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (NEQ s558 0) (NEQ s310 1)) (AND (EQ s91 0) (EQ s189 1))), p2:(AND (EQ s569 0) (EQ s305 1)), p0:(OR (EQ s415 0) (EQ s982 1))], 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 2182 steps with 88 reset in 48 ms.
FORMULA Echo-PT-d02r11-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLCardinality-06 finished in 165310 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 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 998 transition count 874
Applied a total of 3 rules in 20 ms. Remains 998 /1001 variables (removed 3) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2023-03-10 07:56:17] [INFO ] Computed 440 place invariants in 206 ms
[2023-03-10 07:56:20] [INFO ] Implicit Places using invariants in 3516 ms returned []
[2023-03-10 07:56:20] [INFO ] Invariant cache hit.
[2023-03-10 07:58:51] [INFO ] Performed 610/998 implicitness test of which 0 returned IMPLICIT in 150 seconds.
[2023-03-10 07:58:51] [INFO ] Timeout of Implicit test with SMT after 150 seconds.
[2023-03-10 07:58:51] [INFO ] Implicit Places using invariants and state equation in 151337 ms returned []
Implicit Place search using SMT with State Equation took 154855 ms to find 0 implicit places.
[2023-03-10 07:58:51] [INFO ] Invariant cache hit.
[2023-03-10 07:58:53] [INFO ] Dead Transitions using invariants and state equation in 1560 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 998/1001 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156437 ms. Remains : 998/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-07 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:(EQ s618 1)], 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 1 ms.
FORMULA Echo-PT-d02r11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLCardinality-07 finished in 156554 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) U X(p1)))))'
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 999 transition count 874
Applied a total of 2 rules in 21 ms. Remains 999 /1001 variables (removed 2) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 999 cols
[2023-03-10 07:58:53] [INFO ] Computed 441 place invariants in 285 ms
[2023-03-10 07:58:57] [INFO ] Implicit Places using invariants in 3723 ms returned []
[2023-03-10 07:58:57] [INFO ] Invariant cache hit.
[2023-03-10 08:01:37] [INFO ] Performed 166/999 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 08:01:37] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 08:01:37] [INFO ] Implicit Places using invariants and state equation in 160022 ms returned []
Implicit Place search using SMT with State Equation took 163748 ms to find 0 implicit places.
[2023-03-10 08:01:37] [INFO ] Invariant cache hit.
[2023-03-10 08:01:38] [INFO ] Dead Transitions using invariants and state equation in 1622 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 999/1001 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165396 ms. Remains : 999/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} 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=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s517 1), p0:(OR (EQ s242 0) (EQ s779 1))], 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]]
Entered a terminal (fully accepting) state of product in 109 steps with 1 reset in 1 ms.
FORMULA Echo-PT-d02r11-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLCardinality-08 finished in 165584 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 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Graph (complete) has 2955 edges and 1001 vertex of which 993 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 54 ms. Remains 992 /1001 variables (removed 9) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2023-03-10 08:01:39] [INFO ] Computed 436 place invariants in 246 ms
[2023-03-10 08:01:43] [INFO ] Implicit Places using invariants in 4278 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4282 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/1001 places, 872/874 transitions.
Applied a total of 0 rules in 44 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4381 ms. Remains : 988/1001 places, 872/874 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-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 s200 0) (EQ s948 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 414 reset in 789 ms.
Product exploration explored 100000 steps with 414 reset in 859 ms.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 88 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 2 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 34 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 988 cols
[2023-03-10 08:01:46] [INFO ] Computed 432 place invariants in 226 ms
[2023-03-10 08:01:49] [INFO ] Implicit Places using invariants in 3768 ms returned []
[2023-03-10 08:01:49] [INFO ] Invariant cache hit.
[2023-03-10 08:04:29] [INFO ] Performed 196/988 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 08:04:29] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 08:04:29] [INFO ] Implicit Places using invariants and state equation in 160024 ms returned []
Implicit Place search using SMT with State Equation took 163797 ms to find 0 implicit places.
[2023-03-10 08:04:29] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-10 08:04:29] [INFO ] Invariant cache hit.
[2023-03-10 08:04:31] [INFO ] Dead Transitions using invariants and state equation in 1951 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165846 ms. Remains : 988/988 places, 872/872 transitions.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 131 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=26 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 414 reset in 728 ms.
Product exploration explored 100000 steps with 414 reset in 815 ms.
Support contains 2 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 31 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2023-03-10 08:04:33] [INFO ] Invariant cache hit.
[2023-03-10 08:04:37] [INFO ] Implicit Places using invariants in 3730 ms returned []
[2023-03-10 08:04:37] [INFO ] Invariant cache hit.
[2023-03-10 08:07:17] [INFO ] Performed 165/988 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 08:07:17] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 08:07:17] [INFO ] Implicit Places using invariants and state equation in 160014 ms returned []
Implicit Place search using SMT with State Equation took 163745 ms to find 0 implicit places.
[2023-03-10 08:07:17] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-10 08:07:17] [INFO ] Invariant cache hit.
[2023-03-10 08:07:19] [INFO ] Dead Transitions using invariants and state equation in 1958 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165756 ms. Remains : 988/988 places, 872/872 transitions.
Treatment of property Echo-PT-d02r11-LTLCardinality-10 finished in 340865 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 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Graph (complete) has 2955 edges and 1001 vertex of which 993 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 35 ms. Remains 992 /1001 variables (removed 9) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2023-03-10 08:07:20] [INFO ] Computed 436 place invariants in 238 ms
[2023-03-10 08:07:23] [INFO ] Implicit Places using invariants in 4013 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4016 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/1001 places, 872/874 transitions.
Applied a total of 0 rules in 28 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4079 ms. Remains : 988/1001 places, 872/874 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-12 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 s60 0) (EQ s677 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 414 reset in 725 ms.
Product exploration explored 100000 steps with 414 reset in 809 ms.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
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 (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 76 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 872 rows 988 cols
[2023-03-10 08:07:26] [INFO ] Computed 432 place invariants in 225 ms
[2023-03-10 08:07:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 08:07:41] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 14276 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 23 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2023-03-10 08:07:41] [INFO ] Invariant cache hit.
[2023-03-10 08:07:44] [INFO ] Implicit Places using invariants in 3311 ms returned []
[2023-03-10 08:07:44] [INFO ] Invariant cache hit.
[2023-03-10 08:10:24] [INFO ] Performed 196/988 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 08:10:24] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 08:10:24] [INFO ] Implicit Places using invariants and state equation in 160013 ms returned []
Implicit Place search using SMT with State Equation took 163326 ms to find 0 implicit places.
[2023-03-10 08:10:24] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-10 08:10:24] [INFO ] Invariant cache hit.
[2023-03-10 08:10:26] [INFO ] Dead Transitions using invariants and state equation in 1933 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165309 ms. Remains : 988/988 places, 872/872 transitions.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
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 (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-10 08:10:27] [INFO ] Invariant cache hit.
[2023-03-10 08:10:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 08:10:42] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 14315 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 414 reset in 726 ms.
Product exploration explored 100000 steps with 414 reset in 815 ms.
Support contains 2 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 31 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2023-03-10 08:10:44] [INFO ] Invariant cache hit.
[2023-03-10 08:10:47] [INFO ] Implicit Places using invariants in 3312 ms returned []
[2023-03-10 08:10:47] [INFO ] Invariant cache hit.
[2023-03-10 08:13:27] [INFO ] Performed 196/988 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 08:13:27] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 08:13:27] [INFO ] Implicit Places using invariants and state equation in 160011 ms returned []
Implicit Place search using SMT with State Equation took 163327 ms to find 0 implicit places.
[2023-03-10 08:13:27] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-10 08:13:27] [INFO ] Invariant cache hit.
[2023-03-10 08:13:29] [INFO ] Dead Transitions using invariants and state equation in 1985 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165362 ms. Remains : 988/988 places, 872/872 transitions.
Treatment of property Echo-PT-d02r11-LTLCardinality-12 finished in 369624 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))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 999 transition count 874
Applied a total of 2 rules in 16 ms. Remains 999 /1001 variables (removed 2) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 999 cols
[2023-03-10 08:13:29] [INFO ] Computed 441 place invariants in 307 ms
[2023-03-10 08:13:33] [INFO ] Implicit Places using invariants in 3638 ms returned []
[2023-03-10 08:13:33] [INFO ] Invariant cache hit.
[2023-03-10 08:16:13] [INFO ] Performed 24/999 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 08:16:13] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 08:16:13] [INFO ] Implicit Places using invariants and state equation in 160034 ms returned []
Implicit Place search using SMT with State Equation took 163675 ms to find 0 implicit places.
[2023-03-10 08:16:13] [INFO ] Invariant cache hit.
[2023-03-10 08:16:15] [INFO ] Dead Transitions using invariants and state equation in 1844 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 999/1001 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165536 ms. Remains : 999/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s695 0) (EQ s724 1)) (OR (EQ s593 0) (EQ s679 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 703 ms.
Product exploration explored 100000 steps with 50000 reset in 697 ms.
Computed a total of 999 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 999 transition count 874
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 : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r11-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLCardinality-13 finished in 167405 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))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 998 transition count 874
Applied a total of 3 rules in 18 ms. Remains 998 /1001 variables (removed 3) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2023-03-10 08:16:17] [INFO ] Computed 440 place invariants in 195 ms
[2023-03-10 08:16:21] [INFO ] Implicit Places using invariants in 4215 ms returned []
[2023-03-10 08:16:21] [INFO ] Invariant cache hit.
[2023-03-10 08:16:33] [INFO ] Implicit Places using invariants and state equation in 12331 ms returned []
Implicit Place search using SMT with State Equation took 16547 ms to find 0 implicit places.
[2023-03-10 08:16:33] [INFO ] Invariant cache hit.
[2023-03-10 08:16:34] [INFO ] Dead Transitions using invariants and state equation in 1507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 998/1001 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18074 ms. Remains : 998/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s866 0) (EQ s23 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 623 ms.
Product exploration explored 100000 steps with 50000 reset in 668 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
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 : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r11-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLCardinality-14 finished in 19819 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)))'
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)))'
[2023-03-10 08:16:36] [INFO ] Flatten gal took : 52 ms
[2023-03-10 08:16:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 08:16:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1001 places, 874 transitions and 4570 arcs took 8 ms.
Total runtime 1717784 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Echo-PT-d02r11
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1678436243407

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 Echo-PT-d02r11-LTLCardinality-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r11-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Echo-PT-d02r11-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 7/32 Echo-PT-d02r11-LTLCardinality-12 436411 m, 87282 m/sec, 1219221 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r11-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Echo-PT-d02r11-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 13/32 Echo-PT-d02r11-LTLCardinality-12 824136 m, 77545 m/sec, 2488285 t fired, .

Time elapsed: 10 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r11-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Echo-PT-d02r11-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 19/32 Echo-PT-d02r11-LTLCardinality-12 1297952 m, 94763 m/sec, 3693437 t fired, .

Time elapsed: 15 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r11-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Echo-PT-d02r11-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 26/32 Echo-PT-d02r11-LTLCardinality-12 1773134 m, 95036 m/sec, 4879510 t fired, .

Time elapsed: 20 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Echo-PT-d02r11-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r11-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Echo-PT-d02r11-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 Echo-PT-d02r11-LTLCardinality-10
lola: time limit : 3575 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r11-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r11-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3575 10/32 Echo-PT-d02r11-LTLCardinality-10 568535 m, 113707 m/sec, 1294342 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r11-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r11-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3575 18/32 Echo-PT-d02r11-LTLCardinality-10 1123009 m, 110894 m/sec, 2555403 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r11-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d02r11-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3575 27/32 Echo-PT-d02r11-LTLCardinality-10 1659812 m, 107360 m/sec, 3806983 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for Echo-PT-d02r11-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d02r11-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d02r11-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Echo-PT-d02r11-LTLCardinality-10: LTL unknown AGGR
Echo-PT-d02r11-LTLCardinality-12: LTL unknown AGGR


Time elapsed: 45 secs. Pages in use: 32

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="Echo-PT-d02r11"
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 Echo-PT-d02r11, 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 r167-tall-167838852500059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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