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.r261-smll-167863536600603.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 itstools
Input is Peterson-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536600603
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 13K Feb 25 22:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 25 22:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 25 22:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 22:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 100K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679043792662

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-2
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-17 09:03:15] [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]
[2023-03-17 09:03:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:03:16] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-17 09:03:16] [INFO ] Transformed 102 places.
[2023-03-17 09:03:16] [INFO ] Transformed 126 transitions.
[2023-03-17 09:03:16] [INFO ] Found NUPN structural information;
[2023-03-17 09:03:16] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-2-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 20 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:16] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 09:03:16] [INFO ] Computed 11 place invariants in 22 ms
[2023-03-17 09:03:16] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-17 09:03:16] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:16] [INFO ] Invariant cache hit.
[2023-03-17 09:03:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:03:17] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2023-03-17 09:03:17] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:17] [INFO ] Invariant cache hit.
[2023-03-17 09:03:17] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 929 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 76 out of 102 places after structural reductions.
[2023-03-17 09:03:17] [INFO ] Flatten gal took : 66 ms
[2023-03-17 09:03:17] [INFO ] Flatten gal took : 27 ms
[2023-03-17 09:03:17] [INFO ] Input system was already deterministic with 126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 20) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:03:18] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:18] [INFO ] Invariant cache hit.
[2023-03-17 09:03:18] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-17 09:03:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-17 09:03:18] [INFO ] After 111ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:03:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:03:18] [INFO ] After 24ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:03:18] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:03:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-17 09:03:18] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 09:03:18] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:03:18] [INFO ] After 20ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 09:03:18] [INFO ] After 54ms 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-03-17 09:03:19] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 70 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 68 transition count 92
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 68 place count 68 transition count 74
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 104 place count 50 transition count 74
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 114 place count 45 transition count 69
Applied a total of 114 rules in 33 ms. Remains 45 /102 variables (removed 57) and now considering 69/126 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 45/102 places, 69/126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 1842 steps, run visited all 1 properties in 27 ms. (steps per millisecond=68 )
Probabilistic random walk after 1842 steps, saw 483 distinct states, run finished after 27 ms. (steps per millisecond=68 ) properties seen :1
FORMULA Peterson-PT-2-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Peterson-PT-2-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&G(p2)))))'
Support contains 36 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:19] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:19] [INFO ] Invariant cache hit.
[2023-03-17 09:03:19] [INFO ] Implicit Places using invariants in 149 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 153 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 467 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(LEQ 3 (ADD s92 s93 s94 s95 s96 s97)), p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s18) (ADD s57 s61 s65 s66 s67 s68)), p1:(O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-2-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLCardinality-00 finished in 718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 102 transition count 92
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 68 transition count 92
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 68 place count 68 transition count 78
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 96 place count 54 transition count 78
Applied a total of 96 rules in 21 ms. Remains 54 /102 variables (removed 48) and now considering 78/126 (removed 48) transitions.
[2023-03-17 09:03:20] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
// Phase 1: matrix 72 rows 54 cols
[2023-03-17 09:03:20] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 09:03:20] [INFO ] Implicit Places using invariants in 142 ms returned [37, 39, 40]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 145 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/102 places, 78/126 transitions.
Applied a total of 0 rules in 15 ms. Remains 51 /51 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 51/102 places, 78/126 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-01 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:(GT 2 (ADD s12 s13 s14 s15 s16 s18))], 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 0 reset in 554 ms.
Product exploration explored 100000 steps with 0 reset in 326 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 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 90 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished Best-First random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 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 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 78/78 transitions.
Applied a total of 0 rules in 6 ms. Remains 51 /51 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-17 09:03:22] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
// Phase 1: matrix 72 rows 51 cols
[2023-03-17 09:03:22] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-17 09:03:22] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-17 09:03:22] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
[2023-03-17 09:03:22] [INFO ] Invariant cache hit.
[2023-03-17 09:03:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:03:22] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-17 09:03:22] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 09:03:22] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
[2023-03-17 09:03:22] [INFO ] Invariant cache hit.
[2023-03-17 09:03:22] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 438 ms. Remains : 51/51 places, 78/78 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 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 102 ms :[(NOT p0), (NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 196 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 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 211 ms.
Product exploration explored 100000 steps with 1 reset in 160 ms.
Built C files in :
/tmp/ltsmin3659452267535223369
[2023-03-17 09:03:23] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2023-03-17 09:03:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 09:03:23] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2023-03-17 09:03:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 09:03:23] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2023-03-17 09:03:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 09:03:23] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3659452267535223369
Running compilation step : cd /tmp/ltsmin3659452267535223369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 432 ms.
Running link step : cd /tmp/ltsmin3659452267535223369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin3659452267535223369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17836682906897790595.hoa' '--buchi-type=spotba'
LTSmin run took 141 ms.
FORMULA Peterson-PT-2-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-PT-2-LTLCardinality-01 finished in 4211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 27 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:24] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 09:03:24] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-17 09:03:24] [INFO ] Implicit Places using invariants in 121 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 124 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GT (ADD s92 s93 s94 s95 s96 s97) (ADD s90 s91 s98)), p1:(LEQ 3 (ADD s62 s63 s64 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s80 s81 s82 s83 s84))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLCardinality-02 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 15 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 102 transition count 102
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 78 transition count 102
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 48 place count 78 transition count 84
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 60 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 54 transition count 78
Applied a total of 96 rules in 19 ms. Remains 54 /102 variables (removed 48) and now considering 78/126 (removed 48) transitions.
[2023-03-17 09:03:24] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
// Phase 1: matrix 72 rows 54 cols
[2023-03-17 09:03:24] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-17 09:03:24] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-17 09:03:24] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
[2023-03-17 09:03:24] [INFO ] Invariant cache hit.
[2023-03-17 09:03:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:03:25] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-17 09:03:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 09:03:25] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
[2023-03-17 09:03:25] [INFO ] Invariant cache hit.
[2023-03-17 09:03:25] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/102 places, 78/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 373 ms. Remains : 54/102 places, 78/126 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s21 s25 s26 s27 s28 s29 s30 s31 s32 s34 s35 s36)), p1:(OR (LEQ 1 (ADD s21 s25 s26 s27 s28 s29 s30 s31 s32 s34 s35 s36)) (LEQ 3 (ADD s43 s45...], 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 2 reset in 321 ms.
Stack based approach found an accepted trace after 87 steps with 2 reset with depth 65 and stack size 62 in 1 ms.
FORMULA Peterson-PT-2-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLCardinality-06 finished in 885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)||p0)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:25] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 09:03:25] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 09:03:25] [INFO ] Implicit Places using invariants in 91 ms returned [87, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 94 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 126/126 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 100/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s85 0) (EQ s66 1)), p1:(OR (EQ s85 0) (EQ s66 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 30759 reset in 341 ms.
Product exploration explored 100000 steps with 30846 reset in 309 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 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 277 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-17 09:03:27] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2023-03-17 09:03:27] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-17 09:03:27] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 09:03:27] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-2-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-2-LTLCardinality-08 finished in 1710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:27] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 09:03:27] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 09:03:27] [INFO ] Implicit Places using invariants in 77 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-09 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 (NEQ s83 0) (NEQ s5 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 0 reset in 102 ms.
Stack based approach found an accepted trace after 146 steps with 0 reset with depth 147 and stack size 147 in 0 ms.
FORMULA Peterson-PT-2-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLCardinality-09 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:27] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:27] [INFO ] Invariant cache hit.
[2023-03-17 09:03:27] [INFO ] Implicit Places using invariants in 109 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 111 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (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=[p1:(OR (EQ s98 0) (EQ s48 1)), p0:(AND (EQ s76 0) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23149 reset in 153 ms.
Product exploration explored 100000 steps with 23229 reset in 159 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)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6785 steps, including 2 resets, run visited all 2 properties in 17 ms. (steps per millisecond=399 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 277 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:29] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2023-03-17 09:03:29] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-17 09:03:29] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-17 09:03:29] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:29] [INFO ] Invariant cache hit.
[2023-03-17 09:03:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:03:29] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-17 09:03:29] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:29] [INFO ] Invariant cache hit.
[2023-03-17 09:03:29] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 99/99 places, 126/126 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 (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 231 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=231 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23071 reset in 144 ms.
Product exploration explored 100000 steps with 23187 reset in 285 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 99 transition count 126
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 23 place count 99 transition count 136
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 40 place count 99 transition count 136
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 57 place count 82 transition count 119
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 74 place count 82 transition count 119
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 91 place count 82 transition count 119
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 104 place count 69 transition count 106
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 117 place count 69 transition count 106
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 117 rules in 33 ms. Remains 69 /99 variables (removed 30) and now considering 106/126 (removed 20) transitions.
[2023-03-17 09:03:31] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-17 09:03:31] [INFO ] Flow matrix only has 100 transitions (discarded 6 similar events)
// Phase 1: matrix 100 rows 69 cols
[2023-03-17 09:03:31] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-17 09:03:31] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/99 places, 106/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 69/99 places, 106/126 transitions.
Built C files in :
/tmp/ltsmin5217199172886325575
[2023-03-17 09:03:31] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5217199172886325575
Running compilation step : cd /tmp/ltsmin5217199172886325575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 453 ms.
Running link step : cd /tmp/ltsmin5217199172886325575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5217199172886325575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14891391601865473107.hoa' '--buchi-type=spotba'
LTSmin run took 257 ms.
FORMULA Peterson-PT-2-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-PT-2-LTLCardinality-12 finished in 5053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:32] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 09:03:32] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 09:03:32] [INFO ] Implicit Places using invariants in 106 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 108 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s87 0) (EQ s91 1)), p1:(AND (NEQ s67 0) (NEQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], 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 Peterson-PT-2-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLCardinality-13 finished in 316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 72 place count 66 transition count 74
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 104 place count 50 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 44 transition count 68
Applied a total of 116 rules in 12 ms. Remains 44 /102 variables (removed 58) and now considering 68/126 (removed 58) transitions.
[2023-03-17 09:03:33] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
// Phase 1: matrix 62 rows 44 cols
[2023-03-17 09:03:33] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-17 09:03:33] [INFO ] Implicit Places using invariants in 111 ms returned [31, 33, 34]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 112 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/102 places, 68/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 41/102 places, 68/126 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s40 0) (NEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 188 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA Peterson-PT-2-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLCardinality-14 finished in 392 ms.
All properties solved by simple procedures.
Total runtime 17616 ms.

BK_STOP 1679043814438

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="Peterson-PT-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-PT-2, 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 r261-smll-167863536600603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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