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.r487-tall-167912702800227.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 Sudoku-PT-AN09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702800227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 277K Feb 26 09:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 09:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 713K Feb 26 08:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.5M Feb 26 08:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 154K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 538K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 322K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 633K Feb 26 09:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.1M Feb 26 09:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Feb 26 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.6M Feb 26 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 70K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 416K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679176395058

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=Sudoku-PT-AN09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 21:53:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 21:53:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:53:16] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-18 21:53:16] [INFO ] Transformed 972 places.
[2023-03-18 21:53:16] [INFO ] Transformed 729 transitions.
[2023-03-18 21:53:16] [INFO ] Parsed PT model containing 972 places and 729 transitions and 2916 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 61 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 972 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2023-03-18 21:53:17] [INFO ] Computed 243 place invariants in 34 ms
[2023-03-18 21:53:17] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-18 21:53:17] [INFO ] Invariant cache hit.
[2023-03-18 21:53:17] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2023-03-18 21:53:17] [INFO ] Invariant cache hit.
[2023-03-18 21:53:18] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1200 ms. Remains : 972/972 places, 729/729 transitions.
Support contains 972 out of 972 places after structural reductions.
[2023-03-18 21:53:18] [INFO ] Flatten gal took : 103 ms
[2023-03-18 21:53:18] [INFO ] Flatten gal took : 60 ms
[2023-03-18 21:53:18] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 1105 ms. (steps per millisecond=9 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-18 21:53:20] [INFO ] Invariant cache hit.
[2023-03-18 21:53:21] [INFO ] [Real]Absence check using 243 positive place invariants in 49 ms returned sat
[2023-03-18 21:53:21] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 21:53:21] [INFO ] [Nat]Absence check using 243 positive place invariants in 44 ms returned sat
[2023-03-18 21:53:34] [INFO ] After 12317ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :3
[2023-03-18 21:53:46] [INFO ] After 24548ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 21:53:46] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :2
Fused 11 Parikh solutions to 3 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 3 properties in 13 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA Sudoku-PT-AN09-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-PT-AN09-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&G(p1))))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:53:46] [INFO ] Invariant cache hit.
[2023-03-18 21:53:46] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-18 21:53:46] [INFO ] Invariant cache hit.
[2023-03-18 21:53:47] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2023-03-18 21:53:47] [INFO ] Invariant cache hit.
[2023-03-18 21:53:47] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1175 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 12 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-00 finished in 1485 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&&X(p1)))))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 34 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:53:48] [INFO ] Invariant cache hit.
[2023-03-18 21:53:48] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-18 21:53:48] [INFO ] Invariant cache hit.
[2023-03-18 21:53:49] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
[2023-03-18 21:53:49] [INFO ] Invariant cache hit.
[2023-03-18 21:53:49] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1394 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-02 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-02 finished in 1542 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 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 20 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2023-03-18 21:53:49] [INFO ] Computed 26 place invariants in 32 ms
[2023-03-18 21:53:49] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-18 21:53:49] [INFO ] Invariant cache hit.
[2023-03-18 21:53:50] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2023-03-18 21:53:50] [INFO ] Invariant cache hit.
[2023-03-18 21:53:50] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 872 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112...], 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 Sudoku-PT-AN09-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-04 finished in 980 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 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2023-03-18 21:53:50] [INFO ] Computed 243 place invariants in 12 ms
[2023-03-18 21:53:50] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-18 21:53:50] [INFO ] Invariant cache hit.
[2023-03-18 21:53:51] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
[2023-03-18 21:53:51] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-18 21:53:51] [INFO ] Invariant cache hit.
[2023-03-18 21:53:51] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1439 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s837 s...], 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 1420 reset in 7441 ms.
Product exploration explored 100000 steps with 1421 reset in 7635 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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 142 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 41 ms :[(NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=5 )
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 174 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-18 21:54:17] [INFO ] Invariant cache hit.
[2023-03-18 21:54:20] [INFO ] [Real]Absence check using 243 positive place invariants in 76 ms returned sat
[2023-03-18 21:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:54:20] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2023-03-18 21:54:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:54:26] [INFO ] [Nat]Absence check using 243 positive place invariants in 2727 ms returned sat
[2023-03-18 21:54:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:54:27] [INFO ] [Nat]Absence check using state equation in 1332 ms returned sat
[2023-03-18 21:54:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-18 21:54:27] [INFO ] Added : 0 causal constraints over 0 iterations in 120 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 18 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:54:27] [INFO ] Invariant cache hit.
[2023-03-18 21:54:28] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-18 21:54:28] [INFO ] Invariant cache hit.
[2023-03-18 21:54:28] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2023-03-18 21:54:28] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 21:54:28] [INFO ] Invariant cache hit.
[2023-03-18 21:54:29] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1380 ms. Remains : 972/972 places, 729/729 transitions.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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 141 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)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=10 )
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 172 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-18 21:54:39] [INFO ] Invariant cache hit.
[2023-03-18 21:54:41] [INFO ] [Real]Absence check using 243 positive place invariants in 76 ms returned sat
[2023-03-18 21:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:54:42] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2023-03-18 21:54:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:54:47] [INFO ] [Nat]Absence check using 243 positive place invariants in 2615 ms returned sat
[2023-03-18 21:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:54:49] [INFO ] [Nat]Absence check using state equation in 1304 ms returned sat
[2023-03-18 21:54:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-18 21:54:49] [INFO ] Added : 0 causal constraints over 0 iterations in 108 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1420 reset in 7131 ms.
Product exploration explored 100000 steps with 1419 reset in 7211 ms.
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 31 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:55:03] [INFO ] Invariant cache hit.
[2023-03-18 21:55:03] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-18 21:55:03] [INFO ] Invariant cache hit.
[2023-03-18 21:55:04] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2023-03-18 21:55:04] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 21:55:04] [INFO ] Invariant cache hit.
[2023-03-18 21:55:04] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1396 ms. Remains : 972/972 places, 729/729 transitions.
Treatment of property Sudoku-PT-AN09-LTLCardinality-06 finished in 74581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Support contains 3 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 12 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2023-03-18 21:55:05] [INFO ] Computed 26 place invariants in 12 ms
[2023-03-18 21:55:05] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-18 21:55:05] [INFO ] Invariant cache hit.
[2023-03-18 21:55:05] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-18 21:55:05] [INFO ] Invariant cache hit.
[2023-03-18 21:55:06] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 941 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(OR (LEQ 3 s10) (LEQ s236 s117))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 1 reset in 6 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-12 finished in 1205 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)))'
[2023-03-18 21:55:06] [INFO ] Flatten gal took : 47 ms
[2023-03-18 21:55:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 21:55:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 972 places, 729 transitions and 2916 arcs took 5 ms.
Total runtime 110036 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-PT-AN09
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1679176617584

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 Sudoku-PT-AN09-LTLCardinality-06
lola: time limit : 3599 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
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 6/3599 3/32 Sudoku-PT-AN09-LTLCardinality-06 243855 m, 48771 m/sec, 1484158 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 11/3599 5/32 Sudoku-PT-AN09-LTLCardinality-06 425237 m, 36276 m/sec, 2623317 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 16/3599 7/32 Sudoku-PT-AN09-LTLCardinality-06 591721 m, 33296 m/sec, 3779025 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 21/3599 8/32 Sudoku-PT-AN09-LTLCardinality-06 741592 m, 29974 m/sec, 4933967 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 26/3599 10/32 Sudoku-PT-AN09-LTLCardinality-06 898536 m, 31388 m/sec, 6072667 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 31/3599 12/32 Sudoku-PT-AN09-LTLCardinality-06 1069644 m, 34221 m/sec, 7204961 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 36/3599 13/32 Sudoku-PT-AN09-LTLCardinality-06 1233218 m, 32714 m/sec, 8342408 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 41/3599 15/32 Sudoku-PT-AN09-LTLCardinality-06 1397757 m, 32907 m/sec, 9478403 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 46/3599 16/32 Sudoku-PT-AN09-LTLCardinality-06 1543597 m, 29168 m/sec, 10627557 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 51/3599 18/32 Sudoku-PT-AN09-LTLCardinality-06 1698774 m, 31035 m/sec, 11762031 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 56/3599 19/32 Sudoku-PT-AN09-LTLCardinality-06 1854995 m, 31244 m/sec, 12904769 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 61/3599 21/32 Sudoku-PT-AN09-LTLCardinality-06 2005166 m, 30034 m/sec, 14056573 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 66/3599 22/32 Sudoku-PT-AN09-LTLCardinality-06 2151781 m, 29323 m/sec, 15206849 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 71/3599 23/32 Sudoku-PT-AN09-LTLCardinality-06 2295515 m, 28746 m/sec, 16363272 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 76/3599 25/32 Sudoku-PT-AN09-LTLCardinality-06 2437177 m, 28332 m/sec, 17520549 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 81/3599 26/32 Sudoku-PT-AN09-LTLCardinality-06 2566873 m, 25939 m/sec, 18674659 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 86/3599 27/32 Sudoku-PT-AN09-LTLCardinality-06 2682488 m, 23123 m/sec, 19851643 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 91/3599 28/32 Sudoku-PT-AN09-LTLCardinality-06 2822649 m, 28032 m/sec, 20993466 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 96/3599 30/32 Sudoku-PT-AN09-LTLCardinality-06 2992339 m, 33938 m/sec, 22109081 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 101/3599 31/32 Sudoku-PT-AN09-LTLCardinality-06 3154002 m, 32332 m/sec, 23234177 t fired, .

Time elapsed: 102 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for Sudoku-PT-AN09-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN09-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN09-LTLCardinality-06: LTL unknown AGGR


Time elapsed: 107 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="Sudoku-PT-AN09"
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 Sudoku-PT-AN09, 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 r487-tall-167912702800227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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