Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r021-smll-171620128200227.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Anderson-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620128200227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 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-10-LTLCardinality-00
FORMULA_NAME Anderson-PT-10-LTLCardinality-01
FORMULA_NAME Anderson-PT-10-LTLCardinality-02
FORMULA_NAME Anderson-PT-10-LTLCardinality-03
FORMULA_NAME Anderson-PT-10-LTLCardinality-04
FORMULA_NAME Anderson-PT-10-LTLCardinality-05
FORMULA_NAME Anderson-PT-10-LTLCardinality-06
FORMULA_NAME Anderson-PT-10-LTLCardinality-07
FORMULA_NAME Anderson-PT-10-LTLCardinality-08
FORMULA_NAME Anderson-PT-10-LTLCardinality-09
FORMULA_NAME Anderson-PT-10-LTLCardinality-10
FORMULA_NAME Anderson-PT-10-LTLCardinality-11
FORMULA_NAME Anderson-PT-10-LTLCardinality-12
FORMULA_NAME Anderson-PT-10-LTLCardinality-13
FORMULA_NAME Anderson-PT-10-LTLCardinality-14
FORMULA_NAME Anderson-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716525664559

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 04:41:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 04:41:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:41:07] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2024-05-24 04:41:07] [INFO ] Transformed 621 places.
[2024-05-24 04:41:07] [INFO ] Transformed 2480 transitions.
[2024-05-24 04:41:07] [INFO ] Found NUPN structural information;
[2024-05-24 04:41:07] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 170 places :
Symmetric choice reduction at 0 with 170 rule applications. Total rules 170 place count 451 transition count 726
Iterating global reduction 0 with 170 rules applied. Total rules applied 340 place count 451 transition count 726
Applied a total of 340 rules in 134 ms. Remains 451 /621 variables (removed 170) and now considering 726/2480 (removed 1754) transitions.
// Phase 1: matrix 726 rows 451 cols
[2024-05-24 04:41:08] [INFO ] Computed 23 invariants in 67 ms
[2024-05-24 04:41:09] [INFO ] Implicit Places using invariants in 1101 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1153 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 450/621 places, 726/2480 transitions.
Applied a total of 0 rules in 12 ms. Remains 450 /450 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1300 ms. Remains : 450/621 places, 726/2480 transitions.
Support contains 27 out of 450 places after structural reductions.
[2024-05-24 04:41:09] [INFO ] Flatten gal took : 124 ms
[2024-05-24 04:41:09] [INFO ] Flatten gal took : 77 ms
[2024-05-24 04:41:09] [INFO ] Input system was already deterministic with 726 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=15 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 726 rows 450 cols
[2024-05-24 04:41:10] [INFO ] Computed 22 invariants in 17 ms
[2024-05-24 04:41:10] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:41:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 16 ms returned sat
[2024-05-24 04:41:11] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 19 ms returned sat
[2024-05-24 04:41:11] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:41:11] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:11] [INFO ] After 118ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:41:11] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-24 04:41:11] [INFO ] After 918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 726/726 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 450 transition count 626
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 350 transition count 626
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 200 place count 350 transition count 538
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 376 place count 262 transition count 538
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 384 place count 254 transition count 494
Iterating global reduction 2 with 8 rules applied. Total rules applied 392 place count 254 transition count 494
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 396 place count 252 transition count 492
Applied a total of 396 rules in 110 ms. Remains 252 /450 variables (removed 198) and now considering 492/726 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 252/450 places, 492/726 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 963708 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 963708 steps, saw 688847 distinct states, run finished after 3003 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 492 rows 252 cols
[2024-05-24 04:41:14] [INFO ] Computed 22 invariants in 6 ms
[2024-05-24 04:41:15] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:41:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-24 04:41:15] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 12 ms returned sat
[2024-05-24 04:41:15] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:41:15] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:15] [INFO ] After 92ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:41:15] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-24 04:41:15] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 492/492 transitions.
Applied a total of 0 rules in 20 ms. Remains 252 /252 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 252/252 places, 492/492 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 492/492 transitions.
Applied a total of 0 rules in 23 ms. Remains 252 /252 variables (removed 0) and now considering 492/492 (removed 0) transitions.
[2024-05-24 04:41:15] [INFO ] Invariant cache hit.
[2024-05-24 04:41:15] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-24 04:41:15] [INFO ] Invariant cache hit.
[2024-05-24 04:41:16] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:16] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2024-05-24 04:41:16] [INFO ] Redundant transitions in 34 ms returned []
[2024-05-24 04:41:16] [INFO ] Invariant cache hit.
[2024-05-24 04:41:17] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1865 ms. Remains : 252/252 places, 492/492 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 392
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 392
Applied a total of 200 rules in 30 ms. Remains 152 /252 variables (removed 100) and now considering 392/492 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 392 rows 152 cols
[2024-05-24 04:41:17] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 04:41:17] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:41:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-24 04:41:17] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 04:41:17] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:41:17] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-24 04:41:17] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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' '!(F((p0&&X((p1&&G((F(p2)&&F(G(p3)))))))))'
Support contains 7 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 442 transition count 682
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 442 transition count 682
Applied a total of 16 rules in 22 ms. Remains 442 /450 variables (removed 8) and now considering 682/726 (removed 44) transitions.
// Phase 1: matrix 682 rows 442 cols
[2024-05-24 04:41:18] [INFO ] Computed 22 invariants in 5 ms
[2024-05-24 04:41:18] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-24 04:41:18] [INFO ] Invariant cache hit.
[2024-05-24 04:41:18] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:20] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned []
Implicit Place search using SMT with State Equation took 2552 ms to find 0 implicit places.
[2024-05-24 04:41:20] [INFO ] Invariant cache hit.
[2024-05-24 04:41:21] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/450 places, 682/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3525 ms. Remains : 442/450 places, 682/726 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 464 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s174 0) (EQ s23 1)), p1:(OR (EQ s87 0) (EQ s359 1)), p2:(EQ s272 1), p3:(OR (EQ s60 0) (EQ s357 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25 reset in 440 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 1 ms.
FORMULA Anderson-PT-10-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLCardinality-00 finished in 4527 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 U p1))))'
Support contains 4 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 443 transition count 701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 443 transition count 701
Applied a total of 14 rules in 22 ms. Remains 443 /450 variables (removed 7) and now considering 701/726 (removed 25) transitions.
// Phase 1: matrix 701 rows 443 cols
[2024-05-24 04:41:22] [INFO ] Computed 22 invariants in 5 ms
[2024-05-24 04:41:23] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-24 04:41:23] [INFO ] Invariant cache hit.
[2024-05-24 04:41:23] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:24] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
[2024-05-24 04:41:24] [INFO ] Invariant cache hit.
[2024-05-24 04:41:25] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 443/450 places, 701/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3294 ms. Remains : 443/450 places, 701/726 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s122 0) (EQ s85 1)), p0:(OR (EQ s101 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 260 ms.
Product exploration explored 100000 steps with 0 reset in 325 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 p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 97 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 180502 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180502 steps, saw 140671 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 04:41:30] [INFO ] Invariant cache hit.
[2024-05-24 04:41:30] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 04:41:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2024-05-24 04:41:30] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 17 ms returned sat
[2024-05-24 04:41:31] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 04:41:31] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:31] [INFO ] After 252ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 04:41:31] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-24 04:41:31] [INFO ] After 1191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 701/701 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 443 transition count 602
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 344 transition count 602
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 198 place count 344 transition count 514
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 374 place count 256 transition count 514
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 378 place count 254 transition count 512
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 254 transition count 511
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 380 place count 253 transition count 511
Applied a total of 380 rules in 49 ms. Remains 253 /443 variables (removed 190) and now considering 511/701 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 253/443 places, 511/701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Finished Best-First random walk after 4251 steps, including 1 resets, run visited all 3 properties in 19 ms. (steps per millisecond=223 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 8 factoid took 159 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLCardinality-03 finished in 9423 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' '!(((p0&&X(p0)) U (p1&&(G(p2) U G(p3)))))'
Support contains 6 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 450 transition count 626
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 350 transition count 626
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 200 place count 350 transition count 541
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 370 place count 265 transition count 541
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 376 place count 259 transition count 499
Iterating global reduction 2 with 6 rules applied. Total rules applied 382 place count 259 transition count 499
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 390 place count 255 transition count 495
Applied a total of 390 rules in 47 ms. Remains 255 /450 variables (removed 195) and now considering 495/726 (removed 231) transitions.
// Phase 1: matrix 495 rows 255 cols
[2024-05-24 04:41:32] [INFO ] Computed 22 invariants in 5 ms
[2024-05-24 04:41:32] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-24 04:41:32] [INFO ] Invariant cache hit.
[2024-05-24 04:41:32] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:33] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
[2024-05-24 04:41:33] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 04:41:33] [INFO ] Invariant cache hit.
[2024-05-24 04:41:33] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/450 places, 495/726 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1954 ms. Remains : 255/450 places, 495/726 transitions.
Stuttering acceptance computed with spot in 618 ms :[(OR (NOT p1) (NOT p3)), true, (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), (NOT p2), (NOT p3), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p3 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0} source=0 dest: 6}, { cond=(AND p1 p3 p2 p0), acceptance={1} source=0 dest: 7}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0, 1} source=0 dest: 7}, { cond=(AND p1 p3 (NOT p2) p0), acceptance={1} source=0 dest: 8}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p2), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=5 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(OR (AND (NOT p1) p2 p0) (AND (NOT p3) p2 p0)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p3 (NOT p2) p0), acceptance={1} source=6 dest: 8}, { cond=(AND p1 p3 p2 p0), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=7 dest: 6}, { cond=(AND p3 p2 p0), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p3) p2 p0), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p3 (NOT p2) p0), acceptance={1} source=7 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=8 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p3 p2 (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0} source=8 dest: 6}, { cond=(AND p1 p3 p2 p0), acceptance={1} source=8 dest: 7}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0, 1} source=8 dest: 7}, { cond=(OR (AND (NOT p1) p3 p0) (AND p3 (NOT p2) p0)), acceptance={1} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(AND p3 p2), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=10 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=10 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=10 dest: 6}, { cond=(AND p3 (NOT p2) p0), acceptance={1} source=10 dest: 8}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(AND p3 p2 p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(OR (EQ s71 0) (EQ s140 1)), p0:(EQ s119 1), p3:(OR (EQ s109 0) (EQ s19 1)), p2:(EQ s84 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 208 ms.
Product exploration explored 100000 steps with 0 reset in 297 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 p1 (NOT p0) p3 (NOT p2)), (X (NOT (AND (NOT p3) p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p2) p0))), (X (AND p3 (NOT p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X (AND p3 (NOT p0))), (X (AND p1 p3 (NOT p2) (NOT p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (NOT (AND p3 (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) p2 p0))), (X (NOT (AND p3 p2))), (X p3), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p3 p2 (NOT p0)))), (X (NOT (AND p1 p3 p2 p0))), (X (NOT (AND p3 p2 p0))), (X (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (OR (AND (NOT p1) p2 p0) (AND (NOT p3) p2 p0)))), (X (NOT (OR (AND (NOT p1) p3 p0) (AND p3 (NOT p2) p0)))), (X (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p2) p0)))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (AND p3 (NOT p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p2 p0)))), (X (X (NOT (AND p3 p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p3 p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p3 p2 (NOT p0))))), (X (X (NOT (AND p1 p3 p2 p0)))), (X (X (NOT (AND p3 p2 p0)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (NOT (OR (AND (NOT p1) p2 p0) (AND (NOT p3) p2 p0))))), (X (X (NOT (OR (AND (NOT p1) p3 p0) (AND p3 (NOT p2) p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0)))))), (X (X (AND p1 p3 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))))))]
Knowledge based reduction with 62 factoid took 1130 ms. Reduced automaton from 11 states, 60 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished Best-First random walk after 807 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=403 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p3 (NOT p2)), (X (NOT (AND (NOT p3) p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p2) p0))), (X (AND p3 (NOT p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X (AND p3 (NOT p0))), (X (AND p1 p3 (NOT p2) (NOT p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (NOT (AND p3 (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) p2 p0))), (X (NOT (AND p3 p2))), (X p3), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p3 p2 (NOT p0)))), (X (NOT (AND p1 p3 p2 p0))), (X (NOT (AND p3 p2 p0))), (X (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (OR (AND (NOT p1) p2 p0) (AND (NOT p3) p2 p0)))), (X (NOT (OR (AND (NOT p1) p3 p0) (AND p3 (NOT p2) p0)))), (X (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p2) p0)))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (AND p3 (NOT p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p2 p0)))), (X (X (NOT (AND p3 p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p3 p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p3 p2 (NOT p0))))), (X (X (NOT (AND p1 p3 p2 p0)))), (X (X (NOT (AND p3 p2 p0)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (NOT (OR (AND (NOT p1) p2 p0) (AND (NOT p3) p2 p0))))), (X (X (NOT (OR (AND (NOT p1) p3 p0) (AND p3 (NOT p2) p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0)))))), (X (X (AND p1 p3 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))))), (F (NOT p3))]
Property proved to be false thanks to negative knowledge :(F (NOT p3))
Knowledge based reduction with 62 factoid took 1255 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLCardinality-05 finished in 5616 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(G(p0))))'
Support contains 2 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 442 transition count 700
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 442 transition count 700
Applied a total of 16 rules in 19 ms. Remains 442 /450 variables (removed 8) and now considering 700/726 (removed 26) transitions.
// Phase 1: matrix 700 rows 442 cols
[2024-05-24 04:41:37] [INFO ] Computed 22 invariants in 7 ms
[2024-05-24 04:41:38] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-24 04:41:38] [INFO ] Invariant cache hit.
[2024-05-24 04:41:38] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:40] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 2687 ms to find 0 implicit places.
[2024-05-24 04:41:40] [INFO ] Invariant cache hit.
[2024-05-24 04:41:41] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/450 places, 700/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3577 ms. Remains : 442/450 places, 700/726 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s39 0) (EQ s102 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 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLCardinality-06 finished in 3727 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(p1)&&G(!p0))))'
Support contains 4 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 440 transition count 680
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 440 transition count 680
Applied a total of 20 rules in 23 ms. Remains 440 /450 variables (removed 10) and now considering 680/726 (removed 46) transitions.
// Phase 1: matrix 680 rows 440 cols
[2024-05-24 04:41:41] [INFO ] Computed 22 invariants in 5 ms
[2024-05-24 04:41:41] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-24 04:41:41] [INFO ] Invariant cache hit.
[2024-05-24 04:41:42] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:43] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
[2024-05-24 04:41:43] [INFO ] Invariant cache hit.
[2024-05-24 04:41:44] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 440/450 places, 680/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3321 ms. Remains : 440/450 places, 680/726 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), p0]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s234 0) (EQ s388 1)), p1:(OR (EQ s204 0) (EQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10451 steps with 0 reset in 30 ms.
FORMULA Anderson-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLCardinality-07 finished in 3533 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(F(p0))))'
Support contains 1 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 440 transition count 680
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 440 transition count 680
Applied a total of 20 rules in 22 ms. Remains 440 /450 variables (removed 10) and now considering 680/726 (removed 46) transitions.
[2024-05-24 04:41:44] [INFO ] Invariant cache hit.
[2024-05-24 04:41:45] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-24 04:41:45] [INFO ] Invariant cache hit.
[2024-05-24 04:41:45] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:47] [INFO ] Implicit Places using invariants and state equation in 1810 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2024-05-24 04:41:47] [INFO ] Invariant cache hit.
[2024-05-24 04:41:48] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 440/450 places, 680/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3185 ms. Remains : 440/450 places, 680/726 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s233 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 26 reset in 209 ms.
Stack based approach found an accepted trace after 88 steps with 1 reset with depth 77 and stack size 77 in 1 ms.
FORMULA Anderson-PT-10-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLCardinality-08 finished in 3528 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(p0))'
Support contains 1 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 440 transition count 680
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 440 transition count 680
Applied a total of 20 rules in 19 ms. Remains 440 /450 variables (removed 10) and now considering 680/726 (removed 46) transitions.
[2024-05-24 04:41:48] [INFO ] Invariant cache hit.
[2024-05-24 04:41:48] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-24 04:41:48] [INFO ] Invariant cache hit.
[2024-05-24 04:41:49] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:50] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 2286 ms to find 0 implicit places.
[2024-05-24 04:41:50] [INFO ] Invariant cache hit.
[2024-05-24 04:41:51] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 440/450 places, 680/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3239 ms. Remains : 440/450 places, 680/726 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 636 ms.
Product exploration explored 100000 steps with 50000 reset in 603 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), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLCardinality-11 finished in 4603 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((p0||X(F((p0&&F(p1)))))))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 440 transition count 680
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 440 transition count 680
Applied a total of 20 rules in 18 ms. Remains 440 /450 variables (removed 10) and now considering 680/726 (removed 46) transitions.
[2024-05-24 04:41:52] [INFO ] Invariant cache hit.
[2024-05-24 04:41:53] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-24 04:41:53] [INFO ] Invariant cache hit.
[2024-05-24 04:41:53] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:41:55] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 2317 ms to find 0 implicit places.
[2024-05-24 04:41:55] [INFO ] Invariant cache hit.
[2024-05-24 04:41:56] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 440/450 places, 680/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3273 ms. Remains : 440/450 places, 680/726 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s309 1), p1:(AND (NEQ s7 0) (NEQ s279 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 167 ms.
Stack based approach found an accepted trace after 120 steps with 0 reset with depth 121 and stack size 121 in 1 ms.
FORMULA Anderson-PT-10-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLCardinality-15 finished in 3623 ms.
All properties solved by simple procedures.
Total runtime 49443 ms.

BK_STOP 1716525717703

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Anderson-PT-10, 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 r021-smll-171620128200227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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