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-165271820500132.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-C12M10P15D17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820500132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 6.8K Apr 29 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 29 18:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 18:16 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 26K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 08:07 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-C12M10P15D17-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652746102680

Running Version 202205111006
[2022-05-17 00:08:23] [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:08:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:08:23] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2022-05-17 00:08:23] [INFO ] Transformed 111 places.
[2022-05-17 00:08:23] [INFO ] Transformed 45 transitions.
[2022-05-17 00:08:23] [INFO ] Parsed PT model containing 111 places and 45 transitions in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Support contains 52 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 28 places
Discarding 2 places :
Implicit places reduction removed 2 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 12 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:08:24] [INFO ] Computed 37 place invariants in 12 ms
[2022-05-17 00:08:24] [INFO ] Implicit Places using invariants in 163 ms returned [14, 20, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 198 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 2 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 52 out of 78 places after structural reductions.
[2022-05-17 00:08:24] [INFO ] Flatten gal took : 34 ms
[2022-05-17 00:08:24] [INFO ] Flatten gal took : 9 ms
[2022-05-17 00:08:24] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 51 out of 78 places (down from 52) after GAL structural reductions.
Finished random walk after 267 steps, including 0 resets, run visited all 27 properties in 45 ms. (steps per millisecond=5 )
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' '!(F(X(F((G(p0)&&!((X(p1) U p1) U 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 8 places
Discarding 6 places :
Implicit places reduction removed 6 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 7 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:08:25] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 00:08:25] [INFO ] Implicit Places using invariants in 68 ms returned [9, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 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 2 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 373 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, false]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1)), p1:(GEQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8285 reset in 254 ms.
Product exploration explored 100000 steps with 8492 reset in 169 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 (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 460 ms. Reduced automaton from 6 states, 13 edges and 2 AP to 6 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, false]
Finished random walk after 45 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 427 ms. Reduced automaton from 6 states, 13 edges and 2 AP to 6 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, false]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, false]
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:08:27] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-17 00:08:27] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2022-05-17 00:08:27] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:08:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:08:27] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 00:08:27] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 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.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:08:27] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:08:27] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:08:27] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:08:27] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:08:27] [INFO ] Computed 18 place invariants in 6 ms
[2022-05-17 00:08:27] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 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)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 347 ms. Reduced automaton from 6 states, 13 edges and 2 AP to 6 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, false]
Finished random walk after 232 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 411 ms. Reduced automaton from 6 states, 13 edges and 2 AP to 6 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, false]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, false]
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:08:29] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-17 00:08:29] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:08:29] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-17 00:08:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:08:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 00:08:29] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:08:29] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, false]
Product exploration explored 100000 steps with 8338 reset in 141 ms.
Product exploration explored 100000 steps with 8426 reset in 136 ms.
Applying partial POR strategy [false, false, false, false, true, false]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, false]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 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 62 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 8 place count 62 transition count 45
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 22 place count 62 transition count 45
Performed 6 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 6 rules applied. Total rules applied 28 place count 62 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 61 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 61 transition count 44
Deduced a syphon composed of 27 places in 1 ms
Applied a total of 30 rules in 24 ms. Remains 61 /62 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2022-05-17 00:08:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 61 cols
[2022-05-17 00:08:30] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:08:30] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/62 places, 44/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 44/45 transitions.
Product exploration explored 100000 steps with 8438 reset in 159 ms.
Product exploration explored 100000 steps with 8411 reset in 149 ms.
Built C files in :
/tmp/ltsmin7090176711213342838
[2022-05-17 00:08:30] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7090176711213342838
Running compilation step : cd /tmp/ltsmin7090176711213342838;'/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 225 ms.
Running link step : cd /tmp/ltsmin7090176711213342838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7090176711213342838;'/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/stateBased14728647749408566184.hoa' '--buchi-type=spotba'
LTSmin run took 104 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-00 finished in 6115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p0)&&X(G(p1)))))'
Support contains 6 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 5 places
Discarding 6 places :
Implicit places reduction removed 6 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 5 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:08:31] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 00:08:31] [INFO ] Implicit Places using invariants in 45 ms returned [9, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 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 3 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 328 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (GEQ s13 1) (GEQ s17 1) (GEQ s20 1) (GEQ s40 1)), p1:(OR (LT s30 1) (LT s42 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-01 finished in 402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U p2))'
Support contains 8 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 5 places
Discarding 5 places :
Implicit places reduction removed 5 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 10 rules applied. Total rules applied 10 place count 68 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 24 place count 60 transition count 34
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 31 place count 54 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 53 transition count 33
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 32 place count 53 transition count 22
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 58 place count 38 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 58 place count 38 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 64 place count 35 transition count 19
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 4 with 21 rules applied. Total rules applied 85 place count 22 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 21 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 86 place count 21 transition count 10
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 89 place count 19 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 89 place count 19 transition count 9
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 92 place count 17 transition count 9
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 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 97 place count 14 transition count 7
Applied a total of 97 rules in 14 ms. Remains 14 /78 variables (removed 64) and now considering 7/45 (removed 38) transitions.
// Phase 1: matrix 7 rows 14 cols
[2022-05-17 00:08:31] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 00:08:31] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 14 cols
[2022-05-17 00:08:31] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 00:08:31] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-17 00:08:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 14 cols
[2022-05-17 00:08:31] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 00:08:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/78 places, 7/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/78 places, 7/45 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s5 1) (GEQ s9 1)), p1:(AND (GEQ s3 1) (GEQ s10 1)), p0:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7781 reset in 167 ms.
Product exploration explored 100000 steps with 7705 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 p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 512 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (NOT p0), (NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 663 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 7 rows 14 cols
[2022-05-17 00:08:33] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 00:08:33] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 00:08:33] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-17 00:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:08:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 00:08:33] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:08:33] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 14 cols
[2022-05-17 00:08:33] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 00:08:33] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 14 cols
[2022-05-17 00:08:33] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 00:08:33] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-17 00:08:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 14 cols
[2022-05-17 00:08:33] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 00:08:33] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 7/7 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 p0)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 566 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (NOT p0), (NOT p1)]
Finished random walk after 27 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 600 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 7 rows 14 cols
[2022-05-17 00:08:35] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 00:08:35] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 00:08:35] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:08:35] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 00:08:35] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:08:35] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 7731 reset in 160 ms.
Product exploration explored 100000 steps with 7777 reset in 142 ms.
Built C files in :
/tmp/ltsmin8049642155657367037
[2022-05-17 00:08:35] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-17 00:08:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:08:35] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-17 00:08:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:08:35] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-17 00:08:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:08:35] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8049642155657367037
Running compilation step : cd /tmp/ltsmin8049642155657367037;'/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 88 ms.
Running link step : cd /tmp/ltsmin8049642155657367037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8049642155657367037;'/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/stateBased10704432460574280608.hoa' '--buchi-type=spotba'
LTSmin run took 144 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-02 finished in 4492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F((X(p0)||p1))))&&F(!p0)))'
Support contains 7 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 5 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 67 transition count 38
Reduce places removed 11 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 19 rules applied. Total rules applied 32 place count 56 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 48 transition count 30
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 40 place count 48 transition count 18
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 69 place count 31 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 69 place count 31 transition count 14
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 77 place count 27 transition count 14
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 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 95 place count 16 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 15 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 96 place count 15 transition count 6
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 98 place count 14 transition count 6
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 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 103 place count 11 transition count 4
Applied a total of 103 rules in 8 ms. Remains 11 /78 variables (removed 67) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 11 cols
[2022-05-17 00:08:35] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-17 00:08:36] [INFO ] Implicit Places using invariants in 25 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/78 places, 4/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 10/78 places, 4/45 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s8 1)), p1:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s5 1) (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2681 reset in 102 ms.
Product exploration explored 100000 steps with 2502 reset in 209 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 (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 4 rows 10 cols
[2022-05-17 00:08:37] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 00:08:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 00:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:08:37] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:08:37] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 00:08:37] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 7 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 10 cols
[2022-05-17 00:08:37] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 00:08:37] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 4 rows 10 cols
[2022-05-17 00:08:37] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 00:08:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-17 00:08:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 10 cols
[2022-05-17 00:08:37] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 00:08:37] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 4/4 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 (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT 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))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 4 rows 10 cols
[2022-05-17 00:08:37] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 00:08:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 00:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:08:37] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:08:37] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:08:37] [INFO ] Added : 1 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 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2370 reset in 70 ms.
Product exploration explored 100000 steps with 2579 reset in 124 ms.
Built C files in :
/tmp/ltsmin12898991190653178934
[2022-05-17 00:08:38] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-17 00:08:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:08:38] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-17 00:08:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:08:38] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-17 00:08:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:08:38] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12898991190653178934
Running compilation step : cd /tmp/ltsmin12898991190653178934;'/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 76 ms.
Running link step : cd /tmp/ltsmin12898991190653178934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12898991190653178934;'/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/stateBased15524176161217534399.hoa' '--buchi-type=spotba'
LTSmin run took 59 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-03 finished in 2334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 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 6 places :
Implicit places reduction removed 6 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 4 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:08:38] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:08:38] [INFO ] Implicit Places using invariants in 39 ms returned [9, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 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 4 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 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 278 steps with 0 reset in 2 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-04 finished in 142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((G((X(F(X(p0)))&&p1))||F(p2))))))'
Support contains 6 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 6 places
Discarding 6 places :
Implicit places reduction removed 6 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 4 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:08:38] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-17 00:08:38] [INFO ] Implicit Places using invariants in 53 ms returned [10, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 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 150 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s6 1) (LT s19 1) (LT s56 1)), p2:(GEQ s54 1), p0:(AND (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11237 reset in 124 ms.
Product exploration explored 100000 steps with 11160 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 p1 (NOT p2) (NOT p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 262 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:08:39] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:08:39] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:08:39] [INFO ] [Real]Absence check using 16 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 00:08:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:08:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:08:39] [INFO ] Computed and/alt/rep : 44/47/44 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 00:08:39] [INFO ] Added : 34 causal constraints over 7 iterations in 56 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 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 3 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:08:39] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:08:40] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:08:40] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:08:40] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:08:40] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:08:40] [INFO ] Dead Transitions using invariants and state equation in 35 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 p1 (NOT p2) (NOT p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 278 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:08:41] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:08:41] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:08:41] [INFO ] [Real]Absence check using 16 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 00:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:08:41] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:08:41] [INFO ] Computed and/alt/rep : 44/47/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:08:41] [INFO ] Added : 34 causal constraints over 7 iterations in 43 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 11204 reset in 102 ms.
Product exploration explored 100000 steps with 11203 reset in 113 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 6 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 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 9 place count 64 transition count 45
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 22 place count 64 transition count 45
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 64 transition count 45
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 25 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2022-05-17 00:08:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:08:41] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:08:41] [INFO ] Dead Transitions using invariants and state equation in 39 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 13409 reset in 164 ms.
Product exploration explored 100000 steps with 13488 reset in 173 ms.
Built C files in :
/tmp/ltsmin11556779042394863875
[2022-05-17 00:08:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11556779042394863875
Running compilation step : cd /tmp/ltsmin11556779042394863875;'/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 113 ms.
Running link step : cd /tmp/ltsmin11556779042394863875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11556779042394863875;'/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/stateBased8510015268518679163.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 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 6 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:08:57] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:08:57] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:08:57] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:08:57] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:08:57] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:08:57] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin8509624416064614317
[2022-05-17 00:08:57] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8509624416064614317
Running compilation step : cd /tmp/ltsmin8509624416064614317;'/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 119 ms.
Running link step : cd /tmp/ltsmin8509624416064614317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8509624416064614317;'/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/stateBased923988395079480918.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 00:09:12] [INFO ] Flatten gal took : 5 ms
[2022-05-17 00:09:12] [INFO ] Flatten gal took : 4 ms
[2022-05-17 00:09:12] [INFO ] Time to serialize gal into /tmp/LTL6635783819869803815.gal : 2 ms
[2022-05-17 00:09:12] [INFO ] Time to serialize properties into /tmp/LTL17532092934535205561.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6635783819869803815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17532092934535205561.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6635783...267
Read 1 LTL properties
Checking formula 0 : !((F(X(X((G((X(F(X("((MerchantOffer_p2>=1)&&(OfferRequest_p10>=1))"))))&&("(((DeliveryNote_p22_14<1)||(Status_p22_13<1))||(p6_6<1))"))...179
Formula 0 simplified : !FXX(G("(((DeliveryNote_p22_14<1)||(Status_p22_13<1))||(p6_6<1))" & XFX"((MerchantOffer_p2>=1)&&(OfferRequest_p10>=1))") | F"(p6_3>=...159
Detected timeout of ITS tools.
[2022-05-17 00:09:27] [INFO ] Flatten gal took : 4 ms
[2022-05-17 00:09:27] [INFO ] Applying decomposition
[2022-05-17 00:09:27] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5375770780730089346.txt' '-o' '/tmp/graph5375770780730089346.bin' '-w' '/tmp/graph5375770780730089346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5375770780730089346.bin' '-l' '-1' '-v' '-w' '/tmp/graph5375770780730089346.weights' '-q' '0' '-e' '0.001'
[2022-05-17 00:09:27] [INFO ] Decomposing Gal with order
[2022-05-17 00:09:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 00:09:27] [INFO ] Flatten gal took : 29 ms
[2022-05-17 00:09:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-17 00:09:27] [INFO ] Time to serialize gal into /tmp/LTL1280780690137267623.gal : 1 ms
[2022-05-17 00:09:27] [INFO ] Time to serialize properties into /tmp/LTL12718923974947203685.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1280780690137267623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12718923974947203685.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1280780...246
Read 1 LTL properties
Checking formula 0 : !((F(X(X((G((X(F(X("((i5.u6.MerchantOffer_p2>=1)&&(i5.u7.OfferRequest_p10>=1))"))))&&("(((u2.DeliveryNote_p22_14<1)||(u2.Status_p22_13...207
Formula 0 simplified : !FXX(G("(((u2.DeliveryNote_p22_14<1)||(u2.Status_p22_13<1))||(u2.p6_6<1))" & XFX"((i5.u6.MerchantOffer_p2>=1)&&(i5.u7.OfferRequest_p...187
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1813720236417973713
[2022-05-17 00:09:42] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1813720236417973713
Running compilation step : cd /tmp/ltsmin1813720236417973713;'/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 105 ms.
Running link step : cd /tmp/ltsmin1813720236417973713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin1813720236417973713;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X(([]((X(<>(X((LTLAPp0==true))))&&(LTLAPp1==true)))||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-05 finished in 79520 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&G(p2)&&p0)))'
Support contains 4 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 8 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 65 transition count 38
Reduce places removed 11 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 19 rules applied. Total rules applied 31 place count 54 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 39 place count 46 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 39 place count 46 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 62 place count 33 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 62 place count 33 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 31 transition count 18
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 81 place count 22 transition count 12
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 20 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 83 place count 20 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 88 place count 17 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 89 place count 17 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 91 place count 15 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 91 place count 15 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 93 place count 14 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 98 place count 11 transition count 6
Applied a total of 98 rules in 10 ms. Remains 11 /78 variables (removed 67) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 11 cols
[2022-05-17 00:09:58] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:09:58] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 6 rows 11 cols
[2022-05-17 00:09:58] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:09:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-17 00:09:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 11 cols
[2022-05-17 00:09:58] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:09:58] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/78 places, 6/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/78 places, 6/45 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1)), p2:(OR (LT s3 1) (LT s7 1)), p1:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 57 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-06 finished in 330 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||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 8 places
Discarding 6 places :
Implicit places reduction removed 6 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 2 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:09:58] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:09:58] [INFO ] Implicit Places using invariants in 45 ms returned [9, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 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 164 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s40 1), p0:(OR (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 235 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-07 finished in 231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U F(p1))||p0)))'
Support contains 6 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 8 places
Discarding 5 places :
Implicit places reduction removed 5 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 11 rules applied. Total rules applied 11 place count 65 transition count 39
Reduce places removed 10 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 16 rules applied. Total rules applied 27 place count 55 transition count 33
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 49 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 48 transition count 32
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 35 place count 48 transition count 22
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 23 rules applied. Total rules applied 58 place count 35 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 58 place count 35 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 33 transition count 20
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 77 place count 24 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 24 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 79 place count 23 transition count 13
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 81 place count 22 transition count 12
Applied a total of 81 rules in 14 ms. Remains 22 /78 variables (removed 56) and now considering 12/45 (removed 33) transitions.
// Phase 1: matrix 12 rows 22 cols
[2022-05-17 00:09:58] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 00:09:58] [INFO ] Implicit Places using invariants in 30 ms returned [0, 3, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/78 places, 12/45 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 19 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 17 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 16 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 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 1 with 2 rules applied. Total rules applied 6 place count 15 transition count 10
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 13 transition count 9
Applied a total of 9 rules in 5 ms. Remains 13 /19 variables (removed 6) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-17 00:09:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:09:58] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 9 rows 13 cols
[2022-05-17 00:09:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:09:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/78 places, 9/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 13/78 places, 9/45 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s11 1))), p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-08 finished in 184 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !(G(X(G(p1))) U 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 8 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 45
Applied a total of 13 rules in 1 ms. Remains 65 /78 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2022-05-17 00:09:58] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-17 00:09:58] [INFO ] Implicit Places using invariants in 45 ms returned [9, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/78 places, 45/45 transitions.
Applied a total of 0 rules in 1 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 121 ms :[p1, (NOT p0), p1]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s35 1), p0:(AND (GEQ s20 1) (GEQ s23 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Product exploration explored 100000 steps with 50000 reset in 99 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 p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 7 factoid took 145 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-09 finished in 524 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(G(p0))||F(p0))) U !(!p1 U !p2)))'
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 8 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 66 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 56 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 48 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 48 transition count 21
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 59 place count 35 transition count 21
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 34 transition count 20
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 4 with 3 rules applied. Total rules applied 64 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 65 place count 31 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 65 place count 31 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 69 place count 29 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 9 rules applied. Total rules applied 78 place count 24 transition count 13
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 80 place count 23 transition count 12
Applied a total of 80 rules in 10 ms. Remains 23 /78 variables (removed 55) and now considering 12/45 (removed 33) transitions.
// Phase 1: matrix 12 rows 23 cols
[2022-05-17 00:09:59] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-17 00:09:59] [INFO ] Implicit Places using invariants in 30 ms returned [1, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/78 places, 12/45 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 21 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 19 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 18 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 13 transition count 8
Applied a total of 12 rules in 2 ms. Remains 13 /21 variables (removed 8) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:09:59] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:09:59] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:09:59] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:09:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/78 places, 8/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 13/78 places, 8/45 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s10 1)), p2:(AND (GEQ s3 1) (GEQ s7 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 4031 reset in 105 ms.
Stack based approach found an accepted trace after 575 steps with 27 reset with depth 21 and stack size 21 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-10 finished in 272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 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 5 places
Discarding 6 places :
Implicit places reduction removed 6 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 12 rules applied. Total rules applied 12 place count 67 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 30 place count 57 transition count 31
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 39 place count 49 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 48 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 40 place count 48 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 67 place count 32 transition count 19
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 67 place count 32 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 75 place count 28 transition count 15
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 4 with 21 rules applied. Total rules applied 96 place count 15 transition count 7
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 99 place count 13 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 100 place count 12 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 100 place count 12 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 105 place count 9 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 105 place count 9 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 108 place count 7 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 6 with 3 rules applied. Total rules applied 111 place count 5 transition count 2
Applied a total of 111 rules in 8 ms. Remains 5 /78 variables (removed 73) and now considering 2/45 (removed 43) transitions.
// Phase 1: matrix 2 rows 5 cols
[2022-05-17 00:09:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:09:59] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 2 rows 5 cols
[2022-05-17 00:09:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:09:59] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-17 00:09:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 5 cols
[2022-05-17 00:09:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:09:59] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/78 places, 2/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/78 places, 2/45 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 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 50000 reset in 50 ms.
Product exploration explored 100000 steps with 50000 reset in 64 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-11 finished in 312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(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 8 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 45
Applied a total of 13 rules in 5 ms. Remains 65 /78 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2022-05-17 00:09:59] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-17 00:09:59] [INFO ] Implicit Places using invariants in 41 ms returned [9, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/78 places, 45/45 transitions.
Applied a total of 0 rules in 1 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 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-12 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:(GEQ s50 1), p0:(AND (GEQ s7 1) (GEQ s54 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 844 reset in 133 ms.
Product exploration explored 100000 steps with 837 reset in 148 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 p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Finished random walk after 160 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 265 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:10:00] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 00:10:00] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 00:10:00] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 00:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:10:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 00:10:00] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:10:01] [INFO ] Added : 24 causal constraints over 5 iterations in 38 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 63 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 36 place count 48 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 48 place count 36 transition count 24
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 48 place count 36 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 66 place count 26 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 66 place count 26 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 24 transition count 14
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 82 place count 17 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 16 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 83 place count 16 transition count 8
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 85 place count 15 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 11 transition count 6
Applied a total of 91 rules in 6 ms. Remains 11 /63 variables (removed 52) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 11 cols
[2022-05-17 00:10:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:10:01] [INFO ] Implicit Places using invariants in 22 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/63 places, 6/45 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 5
Applied a total of 3 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 8 cols
[2022-05-17 00:10:01] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:10:01] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 8 cols
[2022-05-17 00:10:01] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:10:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/63 places, 5/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/63 places, 5/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 : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-12 finished in 1367 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)&&(!p0 U p1)))||G(X(!(!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 6 places :
Implicit places reduction removed 6 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:10:01] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 00:10:01] [INFO ] Implicit Places using invariants in 45 ms returned [9, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 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 145 ms :[true, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s15 1) (LT s16 1)), p1:(AND (GEQ s19 1) (GEQ s21 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-13 finished in 208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(F((F(p0)||X(p1))))))))'
Support contains 6 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 8 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 66 transition count 40
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 11 rules applied. Total rules applied 20 place count 59 transition count 36
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 55 transition count 36
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 24 place count 55 transition count 23
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 54 place count 38 transition count 23
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 37 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 35 transition count 22
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 58 place count 35 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 66 place count 31 transition count 18
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 82 place count 21 transition count 12
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 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 87 place count 18 transition count 10
Applied a total of 87 rules in 10 ms. Remains 18 /78 variables (removed 60) and now considering 10/45 (removed 35) transitions.
// Phase 1: matrix 10 rows 18 cols
[2022-05-17 00:10:01] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 00:10:01] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 10 rows 18 cols
[2022-05-17 00:10:01] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-17 00:10:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-17 00:10:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 10 rows 18 cols
[2022-05-17 00:10:01] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-17 00:10:01] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/78 places, 10/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/78 places, 10/45 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1)), p1:(AND (OR (LT s0 1) (LT s10 1)) (OR (LT s2 1) (LT s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10949 reset in 93 ms.
Product exploration explored 100000 steps with 10836 reset in 88 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) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 10/10 transitions.
Applied a total of 0 rules in 6 ms. Remains 18 /18 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 18 cols
[2022-05-17 00:10:02] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-17 00:10:02] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 10 rows 18 cols
[2022-05-17 00:10:02] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-17 00:10:02] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-17 00:10:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 18 cols
[2022-05-17 00:10:02] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-17 00:10:02] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10844 reset in 82 ms.
Product exploration explored 100000 steps with 10983 reset in 85 ms.
Built C files in :
/tmp/ltsmin10249144377392519298
[2022-05-17 00:10:03] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2022-05-17 00:10:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:10:03] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2022-05-17 00:10:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:10:03] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2022-05-17 00:10:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:10:03] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10249144377392519298
Running compilation step : cd /tmp/ltsmin10249144377392519298;'/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 85 ms.
Running link step : cd /tmp/ltsmin10249144377392519298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10249144377392519298;'/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/stateBased8569330132634554600.hoa' '--buchi-type=spotba'
LTSmin run took 1802 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-14 finished in 3712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(((G(p1) U !(p2 U p3))&&p0))&&p4))))'
Support contains 11 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 6 places
Discarding 6 places :
Implicit places reduction removed 6 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:10:05] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-17 00:10:05] [INFO ] Implicit Places using invariants in 43 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 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 422 ms :[(OR (NOT p0) (NOT p4) p3), (OR (NOT p0) (NOT p4) p3), (OR (NOT p0) (NOT p4) p3), true, (OR (NOT p0) p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), p3, p3, (AND (NOT p1) p3)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p4), acceptance={} source=2 dest: 3}, { cond=(OR (AND p4 (NOT p0)) (AND p4 p3 (NOT p1))), acceptance={} source=2 dest: 4}, { cond=(AND p4 p0 p3 p1), acceptance={} source=2 dest: 5}, { cond=(OR (AND p4 p0 p2 p1) (AND p4 p0 p3 p1)), acceptance={} source=2 dest: 6}, { cond=(AND p4 p0 p2 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(OR (NOT p0) (AND p3 (NOT p1))), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p3 p1), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p2 (NOT p3) p1), acceptance={1} source=4 dest: 6}, { cond=(AND p0 p3 p1), acceptance={0, 1} source=4 dest: 6}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={1} source=4 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND p3 (NOT p1))), acceptance={0, 1} source=5 dest: 4}, { cond=(OR (AND (NOT p0) p1) (AND p3 p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={1} source=5 dest: 7}, { cond=(AND p0 p2 (NOT p3) p1), acceptance={} source=5 dest: 8}], [{ cond=(AND p3 (NOT p1)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p3 p1), acceptance={0} source=6 dest: 5}, { cond=(AND p2 (NOT p3) p1), acceptance={1} source=6 dest: 6}, { cond=(AND p3 p1), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={1} source=6 dest: 7}], [{ cond=(OR (AND (NOT p0) p3) (AND p3 (NOT p1))), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p0 p3 p1), acceptance={0} source=7 dest: 5}, { cond=(AND p0 p2 (NOT p3) p1), acceptance={1} source=7 dest: 6}, { cond=(AND p0 p3 p1), acceptance={0, 1} source=7 dest: 6}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p1))), acceptance={1} source=7 dest: 7}], [{ cond=(AND p3 (NOT p1)), acceptance={0, 1} source=8 dest: 4}, { cond=(AND p3 p1), acceptance={0} source=8 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={1} source=8 dest: 7}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p4:(OR (LT s6 1) (LT s20 1) (LT s57 1)), p0:(AND (GEQ s17 1) (GEQ s18 1)), p3:(AND (GEQ s10 1) (GEQ s21 1)), p1:(AND (GEQ s29 1) (GEQ s47 1)), p2:(AND (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1048 reset in 173 ms.
Product exploration explored 100000 steps with 1051 reset in 183 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 p4 (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT (AND p4 p0 p3 p1)))), (X (X (NOT (OR (AND p4 p0 p2 p1) (AND p4 p0 p3 p1))))), (X (X p4)), (X (X (NOT (AND p4 p0 p2 (NOT p3) (NOT p1))))), (X (X (OR (AND p4 (NOT p0)) (AND p4 p3 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 375 ms. Reduced automaton from 9 states, 31 edges and 5 AP to 8 states, 26 edges and 4 AP.
Stuttering acceptance computed with spot in 468 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), p3, p3, (AND (NOT p1) p3)]
Finished random walk after 880 steps, including 0 resets, run visited all 12 properties in 17 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND p4 (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT (AND p4 p0 p3 p1)))), (X (X (NOT (OR (AND p4 p0 p2 p1) (AND p4 p0 p3 p1))))), (X (X p4)), (X (X (NOT (AND p4 p0 p2 (NOT p3) (NOT p1))))), (X (X (OR (AND p4 (NOT p0)) (AND p4 p3 (NOT p1)))))]
False Knowledge obtained : [(F (AND p1 (NOT p3) p2)), (F (AND p1 p3)), (F (AND (NOT p1) (NOT p3) p2)), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p3)))), (F (AND (NOT p1) p0 (NOT p3) p2)), (F (AND (NOT p1) p3)), (F (OR (AND p1 (NOT p0)) (AND p1 p3))), (F (NOT (OR (AND (NOT p1) p3) (NOT p0)))), (F (AND p1 p0 (NOT p3) p2)), (F (AND p1 p0 p3)), (F (OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p0) (NOT p3) p2))), (F (OR (AND (NOT p1) p3) (AND (NOT p0) p3)))]
Knowledge based reduction with 6 factoid took 590 ms. Reduced automaton from 8 states, 26 edges and 4 AP to 8 states, 26 edges and 4 AP.
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), p3, p3, (AND (NOT p1) p3)]
Stuttering acceptance computed with spot in 487 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), p3, p3, (AND (NOT p1) p3)]
// Phase 1: matrix 45 rows 65 cols
[2022-05-17 00:10:08] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-17 00:10:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:10:08] [INFO ] [Real]Absence check using 16 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 00:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:10:08] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:10:08] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:10:08] [INFO ] Added : 43 causal constraints over 9 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 65/65 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.
// Phase 1: matrix 45 rows 65 cols
[2022-05-17 00:10:08] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-17 00:10:08] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 45 rows 65 cols
[2022-05-17 00:10:08] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-17 00:10:08] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 65 cols
[2022-05-17 00:10:08] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-17 00:10:08] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 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 p3) (NOT p0) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 8 states, 26 edges and 4 AP to 8 states, 26 edges and 4 AP.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), p3, p3, (AND (NOT p1) p3)]
Finished random walk after 236 steps, including 0 resets, run visited all 12 properties in 14 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), true]
False Knowledge obtained : [(F (AND p1 (NOT p3) p2)), (F (AND p1 p3)), (F (AND (NOT p1) (NOT p3) p2)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)))), (F (AND p0 (NOT p1) (NOT p3) p2)), (F (AND (NOT p1) p3)), (F (OR (AND (NOT p0) p1) (AND p1 p3))), (F (NOT (OR (NOT p0) (AND (NOT p1) p3)))), (F (AND p0 p1 (NOT p3) p2)), (F (AND p0 p1 p3)), (F (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2))), (F (OR (AND (NOT p0) p3) (AND (NOT p1) p3)))]
Knowledge based reduction with 2 factoid took 367 ms. Reduced automaton from 8 states, 26 edges and 4 AP to 8 states, 26 edges and 4 AP.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), p3, p3, (AND (NOT p1) p3)]
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), p3, p3, (AND (NOT p1) p3)]
// Phase 1: matrix 45 rows 65 cols
[2022-05-17 00:10:10] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-17 00:10:10] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:10:10] [INFO ] [Real]Absence check using 16 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 00:10:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:10:10] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:10:10] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:10:10] [INFO ] Added : 43 causal constraints over 9 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), p3, p3, (AND (NOT p1) p3)]
Product exploration explored 100000 steps with 1043 reset in 169 ms.
Product exploration explored 100000 steps with 1066 reset in 167 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (NOT p0) p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), p3, p3, (AND (NOT p1) p3)]
Support contains 8 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 45/45 transitions.
Ensure Unique test removed 2 places
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 63 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 4 place count 63 transition count 45
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 17 place count 63 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 24 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 62 transition count 44
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 62 transition count 44
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 26 rules in 9 ms. Remains 62 /65 variables (removed 3) and now considering 44/45 (removed 1) transitions.
[2022-05-17 00:10:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2022-05-17 00:10:11] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 00:10:11] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/65 places, 44/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/65 places, 44/45 transitions.
Product exploration explored 100000 steps with 2180 reset in 168 ms.
Product exploration explored 100000 steps with 2191 reset in 171 ms.
Built C files in :
/tmp/ltsmin15249226031450357296
[2022-05-17 00:10:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15249226031450357296
Running compilation step : cd /tmp/ltsmin15249226031450357296;'/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 127 ms.
Running link step : cd /tmp/ltsmin15249226031450357296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15249226031450357296;'/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/stateBased10995472481712510910.hoa' '--buchi-type=spotba'
LTSmin run took 316 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-15 finished in 7365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((G((X(F(X(p0)))&&p1))||F(p2))))))'
Found a CL insensitive property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-05
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 6 places
Discarding 6 places :
Implicit places reduction removed 6 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 12 rules applied. Total rules applied 12 place count 66 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 30 place count 56 transition count 31
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 39 place count 48 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 47 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 40 place count 47 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 64 place count 33 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 64 place count 33 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 70 place count 30 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 81 place count 23 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 22 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 82 place count 22 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 88 place count 18 transition count 11
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 89 place count 18 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 91 place count 16 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 91 place count 16 transition count 9
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 7 with 3 rules applied. Total rules applied 94 place count 14 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 94 place count 14 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 96 place count 13 transition count 8
Applied a total of 96 rules in 9 ms. Remains 13 /78 variables (removed 65) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:10:12] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:10:12] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:10:12] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:10:12] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:10:12] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:10:12] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 13/78 places, 8/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/78 places, 8/45 transitions.
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s1 1) (LT s5 1) (LT s11 1)), p2:(GEQ s9 1), p0:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17780 reset in 76 ms.
Product exploration explored 100000 steps with 17783 reset in 88 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 7 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:10:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:10:13] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 00:10:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:10:13] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 00:10:13] [INFO ] Computed and/alt/rep : 7/9/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:10:13] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:10:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:10:14] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:10:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:10:14] [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.
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:10:14] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:10:14] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/13 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 7 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:10:14] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:10:14] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 00:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:10:14] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:10:14] [INFO ] Computed and/alt/rep : 7/9/7 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 00:10:14] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 17805 reset in 65 ms.
Product exploration explored 100000 steps with 17812 reset in 80 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 6 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2022-05-17 00:10:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:10:15] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:10:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/13 places, 8/8 transitions.
Product exploration explored 100000 steps with 17769 reset in 88 ms.
Product exploration explored 100000 steps with 17798 reset in 89 ms.
Built C files in :
/tmp/ltsmin6482297603893105938
[2022-05-17 00:10:15] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6482297603893105938
Running compilation step : cd /tmp/ltsmin6482297603893105938;'/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 81 ms.
Running link step : cd /tmp/ltsmin6482297603893105938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6482297603893105938;'/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/stateBased7911745381098732910.hoa' '--buchi-type=spotba'
LTSmin run took 57 ms.
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-05 finished in 3429 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-05 TRUE TECHNIQUES CL_INSENSITIVE
[2022-05-17 00:10:15] [INFO ] Flatten gal took : 4 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 112116 ms.

BK_STOP 1652746216056

--------------------
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-C12M10P15D17"
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-C12M10P15D17, 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-165271820500132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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