Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820400116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is IOTPpurchase-PT-C03M03P03D03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820400116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 7.4K Apr 29 18:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 18:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 29 18:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 18:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 13 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 60K May 10 09:34 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 IOTPpurchase-PT-C03M03P03D03-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652745844776

Running Version 202205111006
[2022-05-17 00:04:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 00:04:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:04:06] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2022-05-17 00:04:06] [INFO ] Transformed 111 places.
[2022-05-17 00:04:06] [INFO ] Transformed 45 transitions.
[2022-05-17 00:04:06] [INFO ] Parsed PT model containing 111 places and 45 transitions in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 81 transition count 45
Applied a total of 30 rules in 13 ms. Remains 81 /111 variables (removed 30) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 81 cols
[2022-05-17 00:04:06] [INFO ] Computed 37 place invariants in 14 ms
[2022-05-17 00:04:06] [INFO ] Implicit Places using invariants in 165 ms returned [22, 24, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 190 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/111 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 78/111 places, 45/45 transitions.
Support contains 47 out of 78 places after structural reductions.
[2022-05-17 00:04:06] [INFO ] Flatten gal took : 22 ms
[2022-05-17 00:04:06] [INFO ] Flatten gal took : 8 ms
[2022-05-17 00:04:06] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 111 steps, including 0 resets, run visited all 22 properties in 38 ms. (steps per millisecond=2 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p0)))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 66 transition count 45
Applied a total of 12 rules in 3 ms. Remains 66 /78 variables (removed 12) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:06] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:04:06] [INFO ] Implicit Places using invariants in 49 ms returned [9, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/78 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s12 1) (GEQ s15 1) (GEQ s30 1) (GEQ s48 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-00 finished in 285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(X(p0))&&F(p1)))))'
Support contains 8 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 68 transition count 45
Applied a total of 10 rules in 7 ms. Remains 68 /78 variables (removed 10) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 68 cols
[2022-05-17 00:04:07] [INFO ] Computed 24 place invariants in 5 ms
[2022-05-17 00:04:07] [INFO ] Implicit Places using invariants in 72 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/78 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 67/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s13 1) (GEQ s14 1) (GEQ s21 1) (GEQ s36 1) (GEQ s58 1)), p0:(AND (GEQ s9 1) (GEQ s56 1))], nbAcceptance=0, 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 1155 reset in 236 ms.
Product exploration explored 100000 steps with 1146 reset in 150 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 p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 91 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
// Phase 1: matrix 45 rows 67 cols
[2022-05-17 00:04:08] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 00:04:08] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 00:04:08] [INFO ] [Real]Absence check using 15 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 00:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 00:04:08] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:04:08] [INFO ] Added : 37 causal constraints over 8 iterations in 59 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 45 rows 67 cols
[2022-05-17 00:04:08] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-17 00:04:08] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-17 00:04:08] [INFO ] [Real]Absence check using 15 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 00:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:08] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:04:08] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 00:04:08] [INFO ] Added : 32 causal constraints over 7 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2022-05-17 00:04:08] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 00:04:08] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 45 rows 67 cols
[2022-05-17 00:04:09] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 00:04:09] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 67 cols
[2022-05-17 00:04:09] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 00:04:09] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 45/45 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 p1) (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 99 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
// Phase 1: matrix 45 rows 67 cols
[2022-05-17 00:04:09] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 00:04:09] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 00:04:09] [INFO ] [Real]Absence check using 15 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 00:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:09] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 00:04:09] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:04:09] [INFO ] Added : 37 causal constraints over 8 iterations in 62 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 45 rows 67 cols
[2022-05-17 00:04:10] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-17 00:04:10] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 00:04:10] [INFO ] [Real]Absence check using 15 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 00:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:10] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 00:04:10] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:04:10] [INFO ] Added : 32 causal constraints over 7 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1144 reset in 125 ms.
Product exploration explored 100000 steps with 1149 reset in 196 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 67 transition count 45
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 8 place count 67 transition count 45
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 21 place count 67 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 67 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 66 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 66 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 20 ms. Remains 66 /67 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2022-05-17 00:04:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 66 cols
[2022-05-17 00:04:10] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 00:04:10] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 44/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/67 places, 44/45 transitions.
Product exploration explored 100000 steps with 3143 reset in 148 ms.
Product exploration explored 100000 steps with 3130 reset in 157 ms.
Built C files in :
/tmp/ltsmin8730278175743737004
[2022-05-17 00:04:11] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8730278175743737004
Running compilation step : cd /tmp/ltsmin8730278175743737004;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 194 ms.
Running link step : cd /tmp/ltsmin8730278175743737004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8730278175743737004;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased778552061317295798.hoa' '--buchi-type=spotba'
LTSmin run took 1197 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-02 finished in 5511 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p0 U p1))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 24 place count 56 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 50 transition count 33
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 30 place count 50 transition count 21
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 58 place count 34 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 58 place count 34 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 64 place count 31 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 83 place count 19 transition count 11
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 17 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 85 place count 17 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 90 place count 14 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 14 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 12 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 93 place count 12 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 95 place count 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 97 place count 10 transition count 6
Applied a total of 97 rules in 8 ms. Remains 10 /78 variables (removed 68) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 10 cols
[2022-05-17 00:04:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:04:12] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2022-05-17 00:04:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:04:12] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-17 00:04:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2022-05-17 00:04:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:04:12] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/78 places, 6/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/78 places, 6/45 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s9 1), p1:(AND (GEQ s4 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 20297 reset in 103 ms.
Product exploration explored 100000 steps with 20248 reset in 172 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 6 rows 10 cols
[2022-05-17 00:04:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:04:13] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 00:04:13] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-17 00:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:13] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 00:04:13] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:04:13] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 10 cols
[2022-05-17 00:04:13] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:04:13] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2022-05-17 00:04:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:04:13] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-17 00:04:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2022-05-17 00:04:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:04:13] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 6/6 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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 6 rows 10 cols
[2022-05-17 00:04:13] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:04:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 00:04:13] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:04:13] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:04:13] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20311 reset in 62 ms.
Product exploration explored 100000 steps with 20249 reset in 104 ms.
Built C files in :
/tmp/ltsmin11536979630822725959
[2022-05-17 00:04:14] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-17 00:04:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:04:14] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-17 00:04:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:04:14] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-17 00:04:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:04:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11536979630822725959
Running compilation step : cd /tmp/ltsmin11536979630822725959;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 68 ms.
Running link step : cd /tmp/ltsmin11536979630822725959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11536979630822725959;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15062099418141191861.hoa' '--buchi-type=spotba'
LTSmin run took 230 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-03 finished in 1840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||p1)))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 64 transition count 45
Applied a total of 14 rules in 3 ms. Remains 64 /78 variables (removed 14) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:04:14] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 00:04:14] [INFO ] Implicit Places using invariants in 47 ms returned [9, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/78 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s19 1) (GEQ s21 1)), p0:(GEQ s34 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 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 113 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 p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-04 finished in 405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(!p0)||(G(p1) U !p2)||p1)) U X(p1)))'
Support contains 8 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 67 transition count 45
Applied a total of 11 rules in 6 ms. Remains 67 /78 variables (removed 11) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2022-05-17 00:04:14] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 00:04:14] [INFO ] Implicit Places using invariants in 37 ms returned [9, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/78 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 65/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s16 1) (GEQ s42 1)), p0:(AND (GEQ s19 1) (GEQ s45 1)), p2:(AND (GEQ s12 1) (GEQ s15 1) (GEQ s30 1) (GEQ s49 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]]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-05 finished in 179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!(!G(F(X(p0)))||F(X(p1)))) U p2))'
Support contains 9 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 7 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 68 transition count 45
Applied a total of 10 rules in 7 ms. Remains 68 /78 variables (removed 10) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 68 cols
[2022-05-17 00:04:15] [INFO ] Computed 24 place invariants in 0 ms
[2022-05-17 00:04:15] [INFO ] Implicit Places using invariants in 35 ms returned [9, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/78 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (OR (NOT p2) (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s10 1) (GEQ s13 1)), p1:(AND (GEQ s14 1) (GEQ s18 1) (GEQ s21 1) (GEQ s29 1) (GEQ s53 1)), p0:(AND (GEQ s9 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 980 reset in 114 ms.
Product exploration explored 100000 steps with 951 reset in 124 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 10 factoid took 464 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 57 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 10 factoid took 618 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:17] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:04:17] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:04:17] [INFO ] [Real]Absence check using 16 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 00:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 00:04:17] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:04:17] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:17] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:04:17] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:04:17] [INFO ] [Real]Absence check using 16 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 00:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:17] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:04:17] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:04:17] [INFO ] Added : 43 causal constraints over 9 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:17] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:04:17] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:17] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:04:17] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:17] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-17 00:04:17] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 45/45 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 513 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 61 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 10 factoid took 565 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:19] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-17 00:04:19] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:04:19] [INFO ] [Real]Absence check using 16 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 00:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:19] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 00:04:19] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:04:19] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:19] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:04:19] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:04:19] [INFO ] [Real]Absence check using 16 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 00:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:19] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:04:19] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:04:19] [INFO ] Added : 43 causal constraints over 9 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 966 reset in 111 ms.
Product exploration explored 100000 steps with 951 reset in 122 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1)]
Support contains 9 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 66 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 7 place count 66 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 21 place count 66 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 66 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 65 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 65 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 9 ms. Remains 65 /66 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2022-05-17 00:04:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 65 cols
[2022-05-17 00:04:19] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:04:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/66 places, 44/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/66 places, 44/45 transitions.
Entered a terminal (fully accepting) state of product in 1138 steps with 35 reset in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-06 finished in 4881 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||X(X(X(F((p0 U p1)))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 66 transition count 45
Applied a total of 12 rules in 5 ms. Remains 66 /78 variables (removed 12) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:19] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:04:20] [INFO ] Implicit Places using invariants in 37 ms returned [10, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/78 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s6 1) (GEQ s19 1) (GEQ s56 1)), p1:(GEQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1630 reset in 110 ms.
Product exploration explored 100000 steps with 1637 reset in 115 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)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 102 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:04:20] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 00:04:20] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:04:20] [INFO ] [Real]Absence check using 16 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 00:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:20] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:04:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:04:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:04:21] [INFO ] [Nat]Absence check using 16 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-17 00:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:21] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-17 00:04:21] [INFO ] Computed and/alt/rep : 44/47/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:04:21] [INFO ] Added : 41 causal constraints over 9 iterations in 63 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:04:21] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:04:21] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:04:21] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:04:21] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:04:21] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:04:21] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 45/45 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) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 119 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:04:21] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:04:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:04:21] [INFO ] [Real]Absence check using 16 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 00:04:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:21] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:04:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:04:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:04:21] [INFO ] [Nat]Absence check using 16 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-17 00:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:21] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:04:21] [INFO ] Computed and/alt/rep : 44/47/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:04:22] [INFO ] Added : 41 causal constraints over 9 iterations in 49 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1637 reset in 106 ms.
Product exploration explored 100000 steps with 1636 reset in 118 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 45
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 9 place count 64 transition count 45
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 24 place count 64 transition count 45
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 64 transition count 45
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 28 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2022-05-17 00:04:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:04:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:04:22] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/64 places, 45/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 45/45 transitions.
Product exploration explored 100000 steps with 4404 reset in 159 ms.
Product exploration explored 100000 steps with 4393 reset in 172 ms.
Built C files in :
/tmp/ltsmin18302934047963056294
[2022-05-17 00:04:23] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18302934047963056294
Running compilation step : cd /tmp/ltsmin18302934047963056294;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 151 ms.
Running link step : cd /tmp/ltsmin18302934047963056294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18302934047963056294;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15640941593794716722.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-07 finished in 3323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(!(G(F(p0)) U F((G(p0)&&p1))))))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 64 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 18 rules applied. Total rules applied 28 place count 54 transition count 31
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 36 place count 46 transition count 31
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 36 place count 46 transition count 21
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 60 place count 32 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 60 place count 32 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 66 place count 29 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 85 place count 17 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 16 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 86 place count 16 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 15 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 10 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 99 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 99 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 101 place count 7 transition count 5
Applied a total of 101 rules in 7 ms. Remains 7 /78 variables (removed 71) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-17 00:04:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 00:04:23] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-17 00:04:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 00:04:23] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-17 00:04:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-17 00:04:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 00:04:23] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/78 places, 5/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/78 places, 5/45 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s3 1)), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5145 reset in 164 ms.
Stack based approach found an accepted trace after 37 steps with 1 reset with depth 19 and stack size 19 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-08 finished in 289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F((G(p0)&&p1))||G(p2)||p2))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 64 transition count 45
Applied a total of 14 rules in 1 ms. Remains 64 /78 variables (removed 14) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:04:23] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:04:23] [INFO ] Implicit Places using invariants in 31 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/78 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s53 1), p1:(LT s56 1), p0:(OR (LT s9 1) (LT s19 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]]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Stack based approach found an accepted trace after 340 steps with 0 reset with depth 341 and stack size 341 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-10 finished in 385 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(X(p1))||p0))||X(F(p1))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 64 transition count 45
Applied a total of 14 rules in 1 ms. Remains 64 /78 variables (removed 14) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:04:23] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:04:24] [INFO ] Implicit Places using invariants in 38 ms returned [9, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/78 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LT s2 1), p0:(OR (LT s2 1) (AND (GEQ s27 1) (GEQ s39 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 106 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 p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-11 finished in 510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 64 transition count 45
Applied a total of 14 rules in 1 ms. Remains 64 /78 variables (removed 14) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:04:24] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:04:24] [INFO ] Implicit Places using invariants in 36 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/78 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(LT s53 1), p0:(AND (GEQ s9 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 81 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-13 finished in 297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 40
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 23 place count 56 transition count 34
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 29 place count 50 transition count 34
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 29 place count 50 transition count 22
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 57 place count 34 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 57 place count 34 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 31 transition count 19
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 82 place count 19 transition count 12
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 17 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 84 place count 17 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 89 place count 14 transition count 10
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 92 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 92 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 94 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 96 place count 10 transition count 7
Applied a total of 96 rules in 16 ms. Remains 10 /78 variables (removed 68) and now considering 7/45 (removed 38) transitions.
// Phase 1: matrix 7 rows 10 cols
[2022-05-17 00:04:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:04:24] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2022-05-17 00:04:24] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:04:24] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-17 00:04:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2022-05-17 00:04:24] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:04:24] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/78 places, 7/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/78 places, 7/45 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-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 (LT s9 1) (OR (LT s1 1) (LT s2 1)) (OR (LT s5 1) (LT s7 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 85 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-14 finished in 205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U F(!G(!F(G(!X(p0))))))))'
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 64 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 25 place count 55 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 31 place count 49 transition count 33
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 31 place count 49 transition count 20
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 63 place count 30 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 63 place count 30 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 26 transition count 16
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 92 place count 13 transition count 8
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 95 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 96 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 99 place count 8 transition count 6
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 100 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 103 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 105 place count 5 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 106 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 109 place count 2 transition count 2
Applied a total of 109 rules in 5 ms. Remains 2 /78 variables (removed 76) and now considering 2/45 (removed 43) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:04:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:04:25] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:04:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:04:25] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-17 00:04:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:04:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:04:25] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/78 places, 2/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/78 places, 2/45 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 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 42 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-15 finished in 153 ms.
All properties solved by simple procedures.
Total runtime 19270 ms.

BK_STOP 1652745865279

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="IOTPpurchase-PT-C03M03P03D03"
export BK_EXAMINATION="LTLFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is IOTPpurchase-PT-C03M03P03D03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820400116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C03M03P03D03.tgz
mv IOTPpurchase-PT-C03M03P03D03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;