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.r519-tall-167987244700043.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 Anderson-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244700043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 927K Mar 31 16:48 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 Anderson-PT-09-LTLCardinality-00
FORMULA_NAME Anderson-PT-09-LTLCardinality-01
FORMULA_NAME Anderson-PT-09-LTLCardinality-02
FORMULA_NAME Anderson-PT-09-LTLCardinality-03
FORMULA_NAME Anderson-PT-09-LTLCardinality-04
FORMULA_NAME Anderson-PT-09-LTLCardinality-05
FORMULA_NAME Anderson-PT-09-LTLCardinality-06
FORMULA_NAME Anderson-PT-09-LTLCardinality-07
FORMULA_NAME Anderson-PT-09-LTLCardinality-08
FORMULA_NAME Anderson-PT-09-LTLCardinality-09
FORMULA_NAME Anderson-PT-09-LTLCardinality-10
FORMULA_NAME Anderson-PT-09-LTLCardinality-11
FORMULA_NAME Anderson-PT-09-LTLCardinality-12
FORMULA_NAME Anderson-PT-09-LTLCardinality-13
FORMULA_NAME Anderson-PT-09-LTLCardinality-14
FORMULA_NAME Anderson-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680830600063

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=Anderson-PT-09
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 01:23:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 01:23:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 01:23:21] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-04-07 01:23:21] [INFO ] Transformed 505 places.
[2023-04-07 01:23:21] [INFO ] Transformed 1845 transitions.
[2023-04-07 01:23:21] [INFO ] Found NUPN structural information;
[2023-04-07 01:23:21] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 170 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 2 formulas.
FORMULA Anderson-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 124 places :
Symmetric choice reduction at 0 with 124 rule applications. Total rules 124 place count 381 transition count 681
Iterating global reduction 0 with 124 rules applied. Total rules applied 248 place count 381 transition count 681
Applied a total of 248 rules in 174 ms. Remains 381 /505 variables (removed 124) and now considering 681/1845 (removed 1164) transitions.
// Phase 1: matrix 681 rows 381 cols
[2023-04-07 01:23:22] [INFO ] Computed 21 invariants in 37 ms
[2023-04-07 01:23:22] [INFO ] Implicit Places using invariants in 481 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 504 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 380/505 places, 681/1845 transitions.
Applied a total of 0 rules in 13 ms. Remains 380 /380 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 692 ms. Remains : 380/505 places, 681/1845 transitions.
Support contains 41 out of 380 places after structural reductions.
[2023-04-07 01:23:22] [INFO ] Flatten gal took : 79 ms
[2023-04-07 01:23:22] [INFO ] Flatten gal took : 54 ms
[2023-04-07 01:23:22] [INFO ] Input system was already deterministic with 681 transitions.
Support contains 33 out of 380 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 22) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 681 rows 380 cols
[2023-04-07 01:23:23] [INFO ] Computed 20 invariants in 16 ms
[2023-04-07 01:23:23] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 01:23:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 01:23:23] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 14 ms returned sat
[2023-04-07 01:23:24] [INFO ] After 563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 01:23:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:24] [INFO ] After 232ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 01:23:24] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-04-07 01:23:24] [INFO ] After 1224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 300 transition count 601
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 160 place count 300 transition count 533
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 296 place count 232 transition count 533
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 312 place count 216 transition count 421
Iterating global reduction 2 with 16 rules applied. Total rules applied 328 place count 216 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 334 place count 213 transition count 418
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 335 place count 213 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 336 place count 212 transition count 417
Applied a total of 336 rules in 67 ms. Remains 212 /380 variables (removed 168) and now considering 417/681 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 212/380 places, 417/681 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 417 rows 212 cols
[2023-04-07 01:23:25] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 01:23:25] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 01:23:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 01:23:25] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 9 ms returned sat
[2023-04-07 01:23:25] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 01:23:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:25] [INFO ] After 90ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 01:23:25] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-04-07 01:23:25] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 417/417 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 416
Applied a total of 2 rules in 19 ms. Remains 211 /212 variables (removed 1) and now considering 416/417 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 211/212 places, 416/417 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 472899 steps, run visited all 2 properties in 1218 ms. (steps per millisecond=388 )
Probabilistic random walk after 472899 steps, saw 316535 distinct states, run finished after 1218 ms. (steps per millisecond=388 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 361 transition count 550
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 361 transition count 550
Applied a total of 38 rules in 21 ms. Remains 361 /380 variables (removed 19) and now considering 550/681 (removed 131) transitions.
// Phase 1: matrix 550 rows 361 cols
[2023-04-07 01:23:27] [INFO ] Computed 20 invariants in 8 ms
[2023-04-07 01:23:27] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-04-07 01:23:27] [INFO ] Invariant cache hit.
[2023-04-07 01:23:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:28] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2023-04-07 01:23:28] [INFO ] Invariant cache hit.
[2023-04-07 01:23:28] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 550/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1483 ms. Remains : 361/380 places, 550/681 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s125 1) (EQ s230 0) (EQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5 reset in 253 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA Anderson-PT-09-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-00 finished in 2123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 361 transition count 550
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 361 transition count 550
Applied a total of 38 rules in 23 ms. Remains 361 /380 variables (removed 19) and now considering 550/681 (removed 131) transitions.
// Phase 1: matrix 550 rows 361 cols
[2023-04-07 01:23:29] [INFO ] Computed 20 invariants in 6 ms
[2023-04-07 01:23:29] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-04-07 01:23:29] [INFO ] Invariant cache hit.
[2023-04-07 01:23:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:30] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2023-04-07 01:23:30] [INFO ] Invariant cache hit.
[2023-04-07 01:23:30] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 550/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1480 ms. Remains : 361/380 places, 550/681 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-01 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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s54 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 341 ms.
Product exploration explored 100000 steps with 33333 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLCardinality-01 finished in 2290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))||p0))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 567
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 567
Applied a total of 36 rules in 20 ms. Remains 362 /380 variables (removed 18) and now considering 567/681 (removed 114) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 01:23:31] [INFO ] Computed 20 invariants in 7 ms
[2023-04-07 01:23:32] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-04-07 01:23:32] [INFO ] Invariant cache hit.
[2023-04-07 01:23:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:32] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2023-04-07 01:23:32] [INFO ] Invariant cache hit.
[2023-04-07 01:23:33] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 567/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1554 ms. Remains : 362/380 places, 567/681 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s298 0) (EQ s89 1)), p1:(OR (EQ s36 0) (EQ s302 1))], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 371 ms.
Product exploration explored 100000 steps with 50000 reset in 371 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 26 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLCardinality-03 finished in 2454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||(F(p1) U p2)))))'
Support contains 7 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 380 transition count 604
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 155 place count 303 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 302 transition count 603
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 156 place count 302 transition count 534
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 294 place count 233 transition count 534
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 309 place count 218 transition count 455
Iterating global reduction 3 with 15 rules applied. Total rules applied 324 place count 218 transition count 455
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 328 place count 216 transition count 453
Applied a total of 328 rules in 58 ms. Remains 216 /380 variables (removed 164) and now considering 453/681 (removed 228) transitions.
// Phase 1: matrix 453 rows 216 cols
[2023-04-07 01:23:34] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 01:23:34] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-04-07 01:23:34] [INFO ] Invariant cache hit.
[2023-04-07 01:23:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:35] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2023-04-07 01:23:35] [INFO ] Redundant transitions in 28 ms returned []
[2023-04-07 01:23:35] [INFO ] Invariant cache hit.
[2023-04-07 01:23:35] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 216/380 places, 453/681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1207 ms. Remains : 216/380 places, 453/681 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s33 1) (OR (EQ s38 0) (EQ s101 1))), p2:(AND (OR (EQ s125 0) (EQ s163 1)) (OR (EQ s56 0) (EQ s30 1))), p1:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 34 reset in 200 ms.
Stack based approach found an accepted trace after 63 steps with 0 reset with depth 64 and stack size 64 in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-05 finished in 1542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((F(p2)&&p1))))))'
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 567
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 567
Applied a total of 36 rules in 16 ms. Remains 362 /380 variables (removed 18) and now considering 567/681 (removed 114) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 01:23:35] [INFO ] Computed 20 invariants in 7 ms
[2023-04-07 01:23:36] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-04-07 01:23:36] [INFO ] Invariant cache hit.
[2023-04-07 01:23:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:36] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2023-04-07 01:23:37] [INFO ] Invariant cache hit.
[2023-04-07 01:23:37] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 567/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1563 ms. Remains : 362/380 places, 567/681 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s46 0) (EQ s31 1)), p1:(AND (EQ s46 0) (EQ s31 1)), p2:(EQ s46 0)], 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 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-08 finished in 1751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((G(p2)||p1)))))'
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 300 transition count 601
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 300 transition count 531
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 230 transition count 531
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 320 place count 210 transition count 399
Iterating global reduction 2 with 20 rules applied. Total rules applied 340 place count 210 transition count 399
Applied a total of 340 rules in 38 ms. Remains 210 /380 variables (removed 170) and now considering 399/681 (removed 282) transitions.
// Phase 1: matrix 399 rows 210 cols
[2023-04-07 01:23:37] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 01:23:37] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-04-07 01:23:37] [INFO ] Invariant cache hit.
[2023-04-07 01:23:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:38] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-04-07 01:23:38] [INFO ] Redundant transitions in 8 ms returned []
[2023-04-07 01:23:38] [INFO ] Invariant cache hit.
[2023-04-07 01:23:38] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 210/380 places, 399/681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 867 ms. Remains : 210/380 places, 399/681 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s126 0) (EQ s119 1)), p1:(OR (EQ s126 0) (EQ s119 1)), p2:(EQ s209 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 90 reset in 137 ms.
Product exploration explored 100000 steps with 90 reset in 137 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:23:39] [INFO ] Invariant cache hit.
[2023-04-07 01:23:39] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:23:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 01:23:39] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 01:23:39] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 148 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 210 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 399/399 transitions.
Applied a total of 0 rules in 9 ms. Remains 210 /210 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2023-04-07 01:23:39] [INFO ] Invariant cache hit.
[2023-04-07 01:23:39] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-04-07 01:23:39] [INFO ] Invariant cache hit.
[2023-04-07 01:23:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:40] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-04-07 01:23:40] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 01:23:40] [INFO ] Invariant cache hit.
[2023-04-07 01:23:40] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 866 ms. Remains : 210/210 places, 399/399 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 2946 steps, including 0 resets, run visited all 2 properties in 30 ms. (steps per millisecond=98 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 91 reset in 132 ms.
Product exploration explored 100000 steps with 110 reset in 157 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 399/399 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 209 transition count 398
Applied a total of 2 rules in 8 ms. Remains 209 /210 variables (removed 1) and now considering 398/399 (removed 1) transitions.
// Phase 1: matrix 398 rows 209 cols
[2023-04-07 01:23:41] [INFO ] Computed 20 invariants in 5 ms
[2023-04-07 01:23:41] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-04-07 01:23:41] [INFO ] Invariant cache hit.
[2023-04-07 01:23:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:41] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2023-04-07 01:23:41] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 01:23:41] [INFO ] Invariant cache hit.
[2023-04-07 01:23:42] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 209/210 places, 398/399 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 885 ms. Remains : 209/210 places, 398/399 transitions.
Treatment of property Anderson-PT-09-LTLCardinality-09 finished in 4582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 161 place count 300 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 299 transition count 600
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 162 place count 299 transition count 528
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 306 place count 227 transition count 528
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 326 place count 207 transition count 396
Iterating global reduction 3 with 20 rules applied. Total rules applied 346 place count 207 transition count 396
Applied a total of 346 rules in 23 ms. Remains 207 /380 variables (removed 173) and now considering 396/681 (removed 285) transitions.
// Phase 1: matrix 396 rows 207 cols
[2023-04-07 01:23:42] [INFO ] Computed 20 invariants in 4 ms
[2023-04-07 01:23:42] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-04-07 01:23:42] [INFO ] Invariant cache hit.
[2023-04-07 01:23:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:42] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2023-04-07 01:23:42] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 01:23:42] [INFO ] Invariant cache hit.
[2023-04-07 01:23:42] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 207/380 places, 396/681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 815 ms. Remains : 207/380 places, 396/681 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s162 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 85 reset in 136 ms.
Product exploration explored 100000 steps with 78 reset in 163 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 396/396 transitions.
Applied a total of 0 rules in 12 ms. Remains 207 /207 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2023-04-07 01:23:43] [INFO ] Invariant cache hit.
[2023-04-07 01:23:43] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-04-07 01:23:44] [INFO ] Invariant cache hit.
[2023-04-07 01:23:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:44] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2023-04-07 01:23:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 01:23:44] [INFO ] Invariant cache hit.
[2023-04-07 01:23:44] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 808 ms. Remains : 207/207 places, 396/396 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 319 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=319 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 86 reset in 123 ms.
Product exploration explored 100000 steps with 102 reset in 145 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 396/396 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2023-04-07 01:23:45] [INFO ] Invariant cache hit.
[2023-04-07 01:23:45] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-04-07 01:23:45] [INFO ] Invariant cache hit.
[2023-04-07 01:23:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:45] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2023-04-07 01:23:46] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 01:23:46] [INFO ] Invariant cache hit.
[2023-04-07 01:23:46] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 775 ms. Remains : 207/207 places, 396/396 transitions.
Treatment of property Anderson-PT-09-LTLCardinality-10 finished in 4108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||F(((!p1&&X(p2))||G(p2)))))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 360 transition count 549
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 360 transition count 549
Applied a total of 40 rules in 9 ms. Remains 360 /380 variables (removed 20) and now considering 549/681 (removed 132) transitions.
// Phase 1: matrix 549 rows 360 cols
[2023-04-07 01:23:46] [INFO ] Computed 20 invariants in 6 ms
[2023-04-07 01:23:46] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-04-07 01:23:46] [INFO ] Invariant cache hit.
[2023-04-07 01:23:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:47] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2023-04-07 01:23:47] [INFO ] Invariant cache hit.
[2023-04-07 01:23:47] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 360/380 places, 549/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1528 ms. Remains : 360/380 places, 549/681 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s170 0) (EQ s305 1)), p2:(OR (EQ s270 0) (EQ s144 1)), p0:(AND (EQ s144 0) (EQ s270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32 reset in 158 ms.
Stack based approach found an accepted trace after 4197 steps with 0 reset with depth 4198 and stack size 2947 in 7 ms.
FORMULA Anderson-PT-09-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-11 finished in 1945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 551
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 551
Applied a total of 36 rules in 17 ms. Remains 362 /380 variables (removed 18) and now considering 551/681 (removed 130) transitions.
// Phase 1: matrix 551 rows 362 cols
[2023-04-07 01:23:48] [INFO ] Computed 20 invariants in 7 ms
[2023-04-07 01:23:48] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-04-07 01:23:48] [INFO ] Invariant cache hit.
[2023-04-07 01:23:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:49] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2023-04-07 01:23:49] [INFO ] Invariant cache hit.
[2023-04-07 01:23:49] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 551/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1588 ms. Remains : 362/380 places, 551/681 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-13 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:(AND (EQ s277 0) (EQ s288 1)), p0:(AND (EQ s109 0) (EQ s48 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-13 finished in 1732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 567
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 567
Applied a total of 36 rules in 12 ms. Remains 362 /380 variables (removed 18) and now considering 567/681 (removed 114) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 01:23:49] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 01:23:50] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-04-07 01:23:50] [INFO ] Invariant cache hit.
[2023-04-07 01:23:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:51] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
[2023-04-07 01:23:51] [INFO ] Invariant cache hit.
[2023-04-07 01:23:51] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 567/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1635 ms. Remains : 362/380 places, 567/681 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s119 1)), p1:(OR (EQ s35 0) (EQ s119 1) (EQ s82 0))], 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]]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 172 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 80 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:23:52] [INFO ] Invariant cache hit.
[2023-04-07 01:23:52] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:23:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 01:23:52] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 01:23:52] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:23:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:52] [INFO ] After 151ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:23:52] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-07 01:23:52] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 567/567 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 362 transition count 487
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 282 transition count 487
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 282 transition count 417
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 212 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 302 place count 211 transition count 416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 210 transition count 415
Applied a total of 304 rules in 36 ms. Remains 210 /362 variables (removed 152) and now considering 415/567 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 210/362 places, 415/567 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 1147 ms. (steps per millisecond=411 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 1148 ms. (steps per millisecond=411 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 567/567 transitions.
Applied a total of 0 rules in 9 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-04-07 01:23:54] [INFO ] Invariant cache hit.
[2023-04-07 01:23:54] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-04-07 01:23:54] [INFO ] Invariant cache hit.
[2023-04-07 01:23:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:55] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
[2023-04-07 01:23:55] [INFO ] Invariant cache hit.
[2023-04-07 01:23:55] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1526 ms. Remains : 362/362 places, 567/567 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 74 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:23:56] [INFO ] Invariant cache hit.
[2023-04-07 01:23:56] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:23:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 01:23:56] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 01:23:56] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:23:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:23:56] [INFO ] After 150ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:23:56] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-07 01:23:56] [INFO ] After 489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 567/567 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 362 transition count 487
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 282 transition count 487
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 282 transition count 417
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 212 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 302 place count 211 transition count 416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 210 transition count 415
Applied a total of 304 rules in 23 ms. Remains 210 /362 variables (removed 152) and now considering 415/567 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 210/362 places, 415/567 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 1147 ms. (steps per millisecond=411 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 1147 ms. (steps per millisecond=411 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 129 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Product exploration explored 100000 steps with 0 reset in 145 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 66 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 567/567 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 362 transition count 567
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 70 Pre rules applied. Total rules applied 80 place count 362 transition count 567
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 150 place count 362 transition count 567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 151 place count 362 transition count 567
Deduced a syphon composed of 151 places in 0 ms
Applied a total of 151 rules in 41 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-04-07 01:23:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 01:23:58] [INFO ] Computed 20 invariants in 4 ms
[2023-04-07 01:23:58] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/362 places, 567/567 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 429 ms. Remains : 362/362 places, 567/567 transitions.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 567/567 transitions.
Applied a total of 0 rules in 6 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 01:23:58] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 01:23:59] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-04-07 01:23:59] [INFO ] Invariant cache hit.
[2023-04-07 01:23:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:24:00] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
[2023-04-07 01:24:00] [INFO ] Invariant cache hit.
[2023-04-07 01:24:00] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1740 ms. Remains : 362/362 places, 567/567 transitions.
Treatment of property Anderson-PT-09-LTLCardinality-14 finished in 10855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 361 transition count 550
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 361 transition count 550
Applied a total of 38 rules in 8 ms. Remains 361 /380 variables (removed 19) and now considering 550/681 (removed 131) transitions.
// Phase 1: matrix 550 rows 361 cols
[2023-04-07 01:24:00] [INFO ] Computed 20 invariants in 4 ms
[2023-04-07 01:24:00] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-04-07 01:24:00] [INFO ] Invariant cache hit.
[2023-04-07 01:24:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:24:01] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
[2023-04-07 01:24:01] [INFO ] Invariant cache hit.
[2023-04-07 01:24:02] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 550/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1521 ms. Remains : 361/380 places, 550/681 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-15 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:(OR (EQ s58 0) (EQ s336 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 1165 steps with 0 reset in 2 ms.
FORMULA Anderson-PT-09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-15 finished in 1608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((G(p2)||p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Found a Lengthening insensitive property : Anderson-PT-09-LTLCardinality-14
Stuttering acceptance computed with spot in 59 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 300 transition count 601
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 300 transition count 531
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 230 transition count 531
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 318 place count 212 transition count 417
Iterating global reduction 2 with 18 rules applied. Total rules applied 336 place count 212 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 211 transition count 416
Applied a total of 338 rules in 22 ms. Remains 211 /380 variables (removed 169) and now considering 416/681 (removed 265) transitions.
// Phase 1: matrix 416 rows 211 cols
[2023-04-07 01:24:02] [INFO ] Computed 20 invariants in 4 ms
[2023-04-07 01:24:02] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-04-07 01:24:02] [INFO ] Invariant cache hit.
[2023-04-07 01:24:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:24:03] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2023-04-07 01:24:03] [INFO ] Invariant cache hit.
[2023-04-07 01:24:03] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 211/380 places, 416/681 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 812 ms. Remains : 211/380 places, 416/681 transitions.
Running random walk in product with property : Anderson-PT-09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s118 1)), p1:(OR (EQ s35 0) (EQ s118 1) (EQ s81 0))], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 164 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 78 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:24:03] [INFO ] Invariant cache hit.
[2023-04-07 01:24:04] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:24:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-04-07 01:24:04] [INFO ] [Nat]Absence check using 12 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-07 01:24:04] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:24:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:24:04] [INFO ] After 44ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:24:04] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 01:24:04] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 416/416 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 415
Applied a total of 2 rules in 14 ms. Remains 210 /211 variables (removed 1) and now considering 415/416 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 210/211 places, 415/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 1151 ms. (steps per millisecond=410 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 1153 ms. (steps per millisecond=409 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 140 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 416/416 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-04-07 01:24:05] [INFO ] Invariant cache hit.
[2023-04-07 01:24:05] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-04-07 01:24:05] [INFO ] Invariant cache hit.
[2023-04-07 01:24:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:24:06] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-04-07 01:24:06] [INFO ] Invariant cache hit.
[2023-04-07 01:24:06] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 211/211 places, 416/416 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 67 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:24:06] [INFO ] Invariant cache hit.
[2023-04-07 01:24:06] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:24:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:24:06] [INFO ] [Nat]Absence check using 12 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 01:24:06] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:24:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:24:07] [INFO ] After 44ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:24:07] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-07 01:24:07] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 416/416 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 415
Applied a total of 2 rules in 13 ms. Remains 210 /211 variables (removed 1) and now considering 415/416 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 210/211 places, 415/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 1152 ms. (steps per millisecond=409 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 1152 ms. (steps per millisecond=409 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 100 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 150 ms.
Product exploration explored 100000 steps with 0 reset in 271 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 416/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 211 /211 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-04-07 01:24:09] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 01:24:09] [INFO ] Invariant cache hit.
[2023-04-07 01:24:09] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 211/211 places, 416/416 transitions.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 416/416 transitions.
Applied a total of 0 rules in 2 ms. Remains 211 /211 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-04-07 01:24:09] [INFO ] Invariant cache hit.
[2023-04-07 01:24:09] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-04-07 01:24:09] [INFO ] Invariant cache hit.
[2023-04-07 01:24:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 01:24:10] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2023-04-07 01:24:10] [INFO ] Invariant cache hit.
[2023-04-07 01:24:10] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 840 ms. Remains : 211/211 places, 416/416 transitions.
Treatment of property Anderson-PT-09-LTLCardinality-14 finished in 7752 ms.
[2023-04-07 01:24:10] [INFO ] Flatten gal took : 31 ms
[2023-04-07 01:24:10] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 01:24:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 380 places, 681 transitions and 2392 arcs took 4 ms.
Total runtime 48887 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Anderson-PT-09
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA Anderson-PT-09-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680830811485

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Anderson-PT-09-LTLCardinality-09
lola: time limit : 1200 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
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 3/32 Anderson-PT-09-LTLCardinality-09 326632 m, 65326 m/sec, 788067 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1200 5/32 Anderson-PT-09-LTLCardinality-09 640591 m, 62791 m/sec, 1634991 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1200 8/32 Anderson-PT-09-LTLCardinality-09 974105 m, 66702 m/sec, 2493340 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1200 10/32 Anderson-PT-09-LTLCardinality-09 1251940 m, 55567 m/sec, 3289684 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1200 12/32 Anderson-PT-09-LTLCardinality-09 1531590 m, 55930 m/sec, 4048543 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1200 14/32 Anderson-PT-09-LTLCardinality-09 1770163 m, 47714 m/sec, 4827679 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1200 16/32 Anderson-PT-09-LTLCardinality-09 2043885 m, 54744 m/sec, 5606424 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1200 18/32 Anderson-PT-09-LTLCardinality-09 2326193 m, 56461 m/sec, 6392903 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1200 20/32 Anderson-PT-09-LTLCardinality-09 2578514 m, 50464 m/sec, 7012135 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/1200 22/32 Anderson-PT-09-LTLCardinality-09 2813637 m, 47024 m/sec, 7680317 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/1200 24/32 Anderson-PT-09-LTLCardinality-09 3068685 m, 51009 m/sec, 8185524 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/1200 26/32 Anderson-PT-09-LTLCardinality-09 3304699 m, 47202 m/sec, 8863396 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/1200 28/32 Anderson-PT-09-LTLCardinality-09 3551907 m, 49441 m/sec, 9450256 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/1200 30/32 Anderson-PT-09-LTLCardinality-09 3804359 m, 50490 m/sec, 9985456 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/1200 32/32 Anderson-PT-09-LTLCardinality-09 4039522 m, 47032 m/sec, 10628442 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 Anderson-PT-09-LTLCardinality-14
lola: time limit : 1760 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
Anderson-PT-09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1760 9/32 Anderson-PT-09-LTLCardinality-14 981610 m, 196322 m/sec, 1421477 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Anderson-PT-09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Anderson-PT-09-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
Anderson-PT-09-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1760 17/32 Anderson-PT-09-LTLCardinality-14 1864650 m, 176608 m/sec, 2721529 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: FINISHED task # 7 (type EXCL) for Anderson-PT-09-LTLCardinality-14
lola: result : false
lola: markings : 2261674
lola: fired transitions : 3308909
lola: time used : 12.000000
lola: memory pages used : 20
lola: LAUNCH task # 4 (type EXCL) for 3 Anderson-PT-09-LTLCardinality-10
lola: time limit : 3508 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 3/3508 2/32 Anderson-PT-09-LTLCardinality-10 153013 m, 30602 m/sec, 177422 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 8/3508 4/32 Anderson-PT-09-LTLCardinality-10 434783 m, 56354 m/sec, 505901 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 13/3508 7/32 Anderson-PT-09-LTLCardinality-10 713380 m, 55719 m/sec, 832155 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 18/3508 10/32 Anderson-PT-09-LTLCardinality-10 990623 m, 55448 m/sec, 1157859 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 23/3508 12/32 Anderson-PT-09-LTLCardinality-10 1266288 m, 55133 m/sec, 1483037 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 28/3508 14/32 Anderson-PT-09-LTLCardinality-10 1539953 m, 54733 m/sec, 1807523 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 33/3508 17/32 Anderson-PT-09-LTLCardinality-10 1813305 m, 54670 m/sec, 2131949 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 38/3508 19/32 Anderson-PT-09-LTLCardinality-10 2084523 m, 54243 m/sec, 2455640 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 43/3508 22/32 Anderson-PT-09-LTLCardinality-10 2354923 m, 54080 m/sec, 2778379 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 48/3508 24/32 Anderson-PT-09-LTLCardinality-10 2623932 m, 53801 m/sec, 3100827 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 53/3508 27/32 Anderson-PT-09-LTLCardinality-10 2892022 m, 53618 m/sec, 3423183 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 58/3508 29/32 Anderson-PT-09-LTLCardinality-10 3158904 m, 53376 m/sec, 3744929 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 63/3508 31/32 Anderson-PT-09-LTLCardinality-10 3423389 m, 52897 m/sec, 4065561 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for Anderson-PT-09-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-09-LTLCardinality-09: LTL unknown AGGR
Anderson-PT-09-LTLCardinality-10: LTL unknown AGGR
Anderson-PT-09-LTLCardinality-14: LTL false LTL model checker


Time elapsed: 160 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="Anderson-PT-09"
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 Anderson-PT-09, 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 r519-tall-167987244700043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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