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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 7.9K Apr 29 18:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 18:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 18:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 18:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 13 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 63K 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-C01M01P01D01-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652745791620

Running Version 202205111006
[2022-05-17 00:03:12] [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:03:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:03:12] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2022-05-17 00:03:12] [INFO ] Transformed 111 places.
[2022-05-17 00:03:12] [INFO ] Transformed 45 transitions.
[2022-05-17 00:03:12] [INFO ] Found NUPN structural information;
[2022-05-17 00:03:12] [INFO ] Parsed PT model containing 111 places and 45 transitions in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 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 27 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 82 transition count 45
Applied a total of 29 rules in 26 ms. Remains 82 /111 variables (removed 29) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 82 cols
[2022-05-17 00:03:13] [INFO ] Computed 38 place invariants in 10 ms
[2022-05-17 00:03:13] [INFO ] Implicit Places using invariants in 165 ms returned [24, 36, 40, 43, 44, 46]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 197 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 76/111 places, 45/45 transitions.
Support contains 49 out of 76 places after structural reductions.
[2022-05-17 00:03:13] [INFO ] Flatten gal took : 23 ms
[2022-05-17 00:03:13] [INFO ] Flatten gal took : 8 ms
[2022-05-17 00:03:13] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 46 out of 76 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 76 cols
[2022-05-17 00:03:13] [INFO ] Computed 32 place invariants in 15 ms
[2022-05-17 00:03:14] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-17 00:03:14] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2022-05-17 00:03:14] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 62 transition count 33
Reduce places removed 14 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 18 rules applied. Total rules applied 35 place count 48 transition count 29
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 44 transition count 29
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 39 place count 44 transition count 20
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 61 place count 31 transition count 20
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 1 rules applied. Total rules applied 62 place count 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 30 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 63 place count 30 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 67 place count 28 transition count 17
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 23 rules applied. Total rules applied 90 place count 14 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 90 place count 14 transition count 7
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 5 with 3 rules applied. Total rules applied 93 place count 12 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 11 transition count 6
Applied a total of 95 rules in 26 ms. Remains 11 /76 variables (removed 65) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 11 cols
[2022-05-17 00:03:14] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:03:14] [INFO ] Implicit Places using invariants in 23 ms returned [2, 4, 5, 6]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/76 places, 6/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 5 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 4 transition count 3
Applied a total of 6 rules in 1 ms. Remains 4 /7 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 00:03:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:14] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 00:03:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:14] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/76 places, 3/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/76 places, 3/45 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s2 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 33333 reset in 185 ms.
Product exploration explored 100000 steps with 33333 reset in 92 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 (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-00 finished in 679 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(X(G(p0)))))))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 61 transition count 45
Applied a total of 15 rules in 3 ms. Remains 61 /76 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 61 cols
[2022-05-17 00:03:15] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 00:03:15] [INFO ] Implicit Places using invariants in 59 ms returned [9, 12, 13, 16, 21, 26, 27, 28, 29, 30, 31, 32]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 62 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/76 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 49/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 421 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-02 finished in 501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(X((!(p0 U F(p0))||p1)))))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 62 transition count 33
Reduce places removed 16 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 24 rules applied. Total rules applied 41 place count 46 transition count 25
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 49 place count 38 transition count 25
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 49 place count 38 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 67 place count 27 transition count 18
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 1 rules applied. Total rules applied 68 place count 27 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 26 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 69 place count 26 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 73 place count 24 transition count 15
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 5 with 12 rules applied. Total rules applied 85 place count 17 transition count 10
Applied a total of 85 rules in 8 ms. Remains 17 /76 variables (removed 59) and now considering 10/45 (removed 35) transitions.
// Phase 1: matrix 10 rows 17 cols
[2022-05-17 00:03:15] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 00:03:15] [INFO ] Implicit Places using invariants in 37 ms returned [1, 3, 4, 8, 9, 10]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 38 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/76 places, 10/45 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 11 transition count 7
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 6 transition count 5
Applied a total of 10 rules in 1 ms. Remains 6 /11 variables (removed 5) and now considering 5/10 (removed 5) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 00:03:15] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:15] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/76 places, 5/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/76 places, 5/45 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s5 1), p1:(AND (EQ s5 0) (OR (EQ s1 0) (EQ s3 0)))], 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 9156 reset in 106 ms.
Product exploration explored 100000 steps with 9045 reset in 94 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 p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 262 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 3 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:16] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:16] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-17 00:03:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:16] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 5/5 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 p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 9035 reset in 63 ms.
Product exploration explored 100000 steps with 9015 reset in 158 ms.
Built C files in :
/tmp/ltsmin10870280535274969816
[2022-05-17 00:03:17] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-17 00:03:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:17] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-17 00:03:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:17] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-17 00:03:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:17] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10870280535274969816
Running compilation step : cd /tmp/ltsmin10870280535274969816;'/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 166 ms.
Running link step : cd /tmp/ltsmin10870280535274969816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10870280535274969816;'/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/stateBased10888757262312173909.hoa' '--buchi-type=spotba'
LTSmin run took 104 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-04 finished in 2559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p0)))&&(X(p1)||p2)))))'
Support contains 10 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 45
Applied a total of 10 rules in 2 ms. Remains 66 /76 variables (removed 10) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:03:18] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:03:18] [INFO ] Implicit Places using invariants in 42 ms returned [10, 16, 19, 26, 31, 32, 34, 35, 36, 37]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 42 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/76 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 56/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s27 1) (EQ s38 1)), p1:(EQ s52 1), p0:(AND (EQ s5 1) (EQ s12 1) (EQ s13 1) (EQ s14 1) (EQ s17 1) (EQ s22 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-06 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(p0)))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 62 transition count 33
Reduce places removed 14 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 18 rules applied. Total rules applied 35 place count 48 transition count 29
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 44 transition count 29
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 39 place count 44 transition count 20
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 61 place count 31 transition count 20
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 1 rules applied. Total rules applied 62 place count 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 30 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 63 place count 30 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 67 place count 28 transition count 17
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 23 rules applied. Total rules applied 90 place count 14 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 90 place count 14 transition count 7
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 5 with 3 rules applied. Total rules applied 93 place count 12 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 11 transition count 6
Applied a total of 95 rules in 12 ms. Remains 11 /76 variables (removed 65) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 11 cols
[2022-05-17 00:03:18] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:03:18] [INFO ] Implicit Places using invariants in 29 ms returned [2, 4, 5, 6]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 30 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/76 places, 6/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 5 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 4 transition count 3
Applied a total of 6 rules in 1 ms. Remains 4 /7 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 00:03:18] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:18] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 00:03:18] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:18] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/76 places, 3/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/76 places, 3/45 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s2 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 25065 reset in 46 ms.
Product exploration explored 100000 steps with 25102 reset in 48 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 (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 00:03:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 00:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:19] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:03:19] [INFO ] Computed and/alt/rep : 2/3/2 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 00:03:19] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 00:03:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:19] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 00:03:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 00:03:19] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-17 00:03:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 00:03:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 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 p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 00:03:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 00:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:03:19] [INFO ] Computed and/alt/rep : 2/3/2 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:03:19] [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 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25124 reset in 55 ms.
Product exploration explored 100000 steps with 25059 reset in 48 ms.
Built C files in :
/tmp/ltsmin7613033773564721900
[2022-05-17 00:03:19] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2022-05-17 00:03:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:19] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2022-05-17 00:03:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:19] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2022-05-17 00:03:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:19] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7613033773564721900
Running compilation step : cd /tmp/ltsmin7613033773564721900;'/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 71 ms.
Running link step : cd /tmp/ltsmin7613033773564721900;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7613033773564721900;'/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/stateBased15014715482309250034.hoa' '--buchi-type=spotba'
LTSmin run took 74 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-07 finished in 1718 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U !X(X((F(!p0) U F(p1)))))))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 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 63 transition count 45
Applied a total of 13 rules in 2 ms. Remains 63 /76 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:03:20] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-17 00:03:20] [INFO ] Implicit Places using invariants in 73 ms returned [10, 13, 14, 17, 28, 29, 30, 31, 32, 33]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 74 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/76 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 53/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 190 ms :[p1, (AND (NOT p0) p1), p1, true, (AND (NOT p0) p1), p1, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(AND (EQ s6 1) (EQ s18 1) (EQ s24 1) (EQ s51 1)), p1:(AND (EQ s21 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-08 finished in 726 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 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 64 transition count 45
Applied a total of 12 rules in 3 ms. Remains 64 /76 variables (removed 12) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:03:20] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 00:03:20] [INFO ] Implicit Places using invariants in 50 ms returned [10, 13, 18, 23, 29, 30, 31, 32, 33, 35]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 53 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/76 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s12 1) (EQ s13 1) (EQ s20 1) (EQ s25 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2649 reset in 67 ms.
Product exploration explored 100000 steps with 2649 reset in 86 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 32 ms :[(NOT p0)]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 45 rows 54 cols
[2022-05-17 00:03:21] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 00:03:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 00:03:21] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 00:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:21] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 00:03:21] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 00:03:21] [INFO ] Added : 35 causal constraints over 7 iterations in 72 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 45/45 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 54 transition count 15
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 24 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 60 place count 24 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 21 transition count 12
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 2 with 2 rules applied. Total rules applied 68 place count 20 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 19 transition count 11
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 84 place count 10 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 84 place count 10 transition count 4
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 86 place count 9 transition count 4
Applied a total of 86 rules in 4 ms. Remains 9 /54 variables (removed 45) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 9 cols
[2022-05-17 00:03:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:03:21] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 4 rows 9 cols
[2022-05-17 00:03:21] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:03:21] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-17 00:03:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 9 cols
[2022-05-17 00:03:21] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:03:21] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/54 places, 4/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/54 places, 4/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 p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-09 finished in 860 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0) U p1))||X(X(F(p2)))))'
Support contains 10 out of 76 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 45
Applied a total of 10 rules in 2 ms. Remains 66 /76 variables (removed 10) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:03:21] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-17 00:03:21] [INFO ] Implicit Places using invariants in 58 ms returned [11, 14, 19, 30, 31, 32, 33, 34]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 59 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/76 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 58/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (EQ s7 1) (EQ s21 1) (EQ s28 1) (EQ s56 1)), p2:(AND (EQ s5 1) (EQ s13 1) (EQ s14 1) (EQ s22 1) (EQ s27 1) (EQ s49 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 2649 reset in 72 ms.
Product exploration explored 100000 steps with 2648 reset in 73 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 p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 45 rows 58 cols
[2022-05-17 00:03:22] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 00:03:22] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2022-05-17 00:03:22] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-17 00:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 00:03:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:03:22] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-17 00:03:22] [INFO ] Computed and/alt/rep : 44/53/44 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 00:03:22] [INFO ] Added : 38 causal constraints over 8 iterations in 63 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 10 out of 58 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 58 cols
[2022-05-17 00:03:22] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 00:03:22] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 45 rows 58 cols
[2022-05-17 00:03:22] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 00:03:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:03:22] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 58 cols
[2022-05-17 00:03:22] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 00:03:22] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 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 p2)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 45 rows 58 cols
[2022-05-17 00:03:23] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 00:03:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 00:03:23] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-17 00:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 00:03:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:03:23] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 00:03:23] [INFO ] Computed and/alt/rep : 44/53/44 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 00:03:23] [INFO ] Added : 38 causal constraints over 8 iterations in 68 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2648 reset in 71 ms.
Product exploration explored 100000 steps with 2648 reset in 83 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 10 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 45/45 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 57 transition count 45
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 20 place count 57 transition count 45
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 29 place count 57 transition count 45
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 56 transition count 45
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 50 place count 37 transition count 26
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 69 place count 37 transition count 26
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 37 transition count 26
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 80 place count 32 transition count 21
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 85 place count 32 transition count 21
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 85 rules in 14 ms. Remains 32 /58 variables (removed 26) and now considering 21/45 (removed 24) transitions.
[2022-05-17 00:03:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 32 cols
[2022-05-17 00:03:24] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-17 00:03:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/58 places, 21/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/58 places, 21/45 transitions.
Product exploration explored 100000 steps with 12500 reset in 150 ms.
Product exploration explored 100000 steps with 12500 reset in 135 ms.
Built C files in :
/tmp/ltsmin16171140528495879845
[2022-05-17 00:03:24] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16171140528495879845
Running compilation step : cd /tmp/ltsmin16171140528495879845;'/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 107 ms.
Running link step : cd /tmp/ltsmin16171140528495879845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin16171140528495879845;'/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/stateBased1357825097927171206.hoa' '--buchi-type=spotba'
LTSmin run took 221 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-10 finished in 3262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 61 transition count 33
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 46 transition count 28
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 44 place count 41 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 40 transition count 27
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 45 place count 40 transition count 19
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 65 place count 28 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 65 place count 28 transition count 17
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 69 place count 26 transition count 17
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 89 place count 14 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 89 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 4 with 2 rules applied. Total rules applied 91 place count 13 transition count 8
Applied a total of 91 rules in 4 ms. Remains 13 /76 variables (removed 63) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 13 cols
[2022-05-17 00:03:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:03:24] [INFO ] Implicit Places using invariants in 18 ms returned [1, 4, 6, 8]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 19 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/76 places, 8/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 6
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 6 transition count 5
Applied a total of 6 rules in 1 ms. Remains 6 /9 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:24] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:25] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:25] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/76 places, 5/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/76 places, 5/45 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s4 1), p0:(AND (EQ s1 1) (EQ s3 1))], nbAcceptance=0, 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 28503 reset in 119 ms.
Product exploration explored 100000 steps with 28541 reset in 82 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 p1), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 722 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 414 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:26] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 00:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 00:03:26] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 00:03:26] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 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 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:26] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:26] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-17 00:03:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:26] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 5/5 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 00:03:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 00:03:27] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 00:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:03:27] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:03:27] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 66 ms.
Product exploration explored 100000 steps with 20000 reset in 53 ms.
Built C files in :
/tmp/ltsmin13061851301503529233
[2022-05-17 00:03:27] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-17 00:03:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:27] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-17 00:03:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:27] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-17 00:03:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:27] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13061851301503529233
Running compilation step : cd /tmp/ltsmin13061851301503529233;'/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 71 ms.
Running link step : cd /tmp/ltsmin13061851301503529233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13061851301503529233;'/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/stateBased2622469200059431400.hoa' '--buchi-type=spotba'
LTSmin run took 73 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-11 finished in 2620 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p0)&&p1))||X((p2 U X(p3))))))'
Support contains 8 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 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 64 transition count 45
Applied a total of 12 rules in 2 ms. Remains 64 /76 variables (removed 12) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:03:27] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:03:27] [INFO ] Implicit Places using invariants in 45 ms returned [10, 13, 18, 23, 29, 30, 31, 32, 33, 35]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 56 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/76 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 391 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), true, (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 8}], [{ cond=(AND p2 p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=1 dest: 6}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 7}], [{ cond=(AND p2 (NOT p3) p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={} source=2 dest: 3}, { cond=(OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p1))), acceptance={} source=2 dest: 6}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=3 dest: 9}], [{ cond=p2, acceptance={} source=4 dest: 6}, { cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p3), acceptance={} source=7 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(EQ s48 1), p0:(EQ s47 0), p1:(OR (EQ s5 0) (EQ s12 0) (EQ s13 0) (EQ s20 0) (EQ s25 0) (EQ s45 0)), p3:(EQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-12 finished in 465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(p0) U p1)))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 62 transition count 45
Applied a total of 14 rules in 4 ms. Remains 62 /76 variables (removed 14) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:03:28] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:03:28] [INFO ] Implicit Places using invariants in 39 ms returned [9, 12, 13, 16, 21, 26, 27, 28, 29, 30, 31, 32]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 40 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/76 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 50/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, p0, p1, p1, (AND p0 p1)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s12 1) (EQ s29 1)), p1:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 73 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 p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 147 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-13 finished in 506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(X(F(!p0))) U p1))))'
Support contains 7 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 62 transition count 45
Applied a total of 14 rules in 1 ms. Remains 62 /76 variables (removed 14) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:03:28] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:03:28] [INFO ] Implicit Places using invariants in 46 ms returned [9, 12, 13, 16, 21, 26, 27, 28, 31, 32]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 47 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/76 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 52/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s22 1) (EQ s41 1)) (AND (EQ s21 1) (EQ s28 1))), p0:(OR (EQ s46 1) (AND (EQ s13 1) (EQ s29 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2511 reset in 62 ms.
Product exploration explored 100000 steps with 2530 reset in 73 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 (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
// Phase 1: matrix 45 rows 52 cols
[2022-05-17 00:03:29] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 00:03:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-17 00:03:29] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 00:03:29] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:03:29] [INFO ] Added : 12 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 7 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 52 cols
[2022-05-17 00:03:30] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 00:03:30] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 45 rows 52 cols
[2022-05-17 00:03:30] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 00:03:30] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 52 cols
[2022-05-17 00:03:30] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 00:03:30] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 402 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
// Phase 1: matrix 45 rows 52 cols
[2022-05-17 00:03:31] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 00:03:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-17 00:03:31] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-17 00:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:31] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 00:03:31] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:03:31] [INFO ] Added : 12 causal constraints over 3 iterations in 35 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Product exploration explored 100000 steps with 2486 reset in 66 ms.
Product exploration explored 100000 steps with 2525 reset in 79 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Support contains 7 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 45/45 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 52 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 15 place count 52 transition count 45
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 26 place count 52 transition count 45
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 51 transition count 45
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 41 place count 38 transition count 32
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 54 place count 38 transition count 32
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 38 transition count 32
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 34 transition count 28
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 34 transition count 28
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 68 rules in 12 ms. Remains 34 /52 variables (removed 18) and now considering 28/45 (removed 17) transitions.
[2022-05-17 00:03:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 34 cols
[2022-05-17 00:03:31] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 00:03:31] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/52 places, 28/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/52 places, 28/45 transitions.
Product exploration explored 100000 steps with 8141 reset in 109 ms.
Product exploration explored 100000 steps with 8173 reset in 105 ms.
Built C files in :
/tmp/ltsmin10280809425426252395
[2022-05-17 00:03:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10280809425426252395
Running compilation step : cd /tmp/ltsmin10280809425426252395;'/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 114 ms.
Running link step : cd /tmp/ltsmin10280809425426252395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10280809425426252395;'/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/stateBased16265666483896436669.hoa' '--buchi-type=spotba'
LTSmin run took 195 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-14 finished in 4004 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F((X(X(p0))||p1))))))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 62 transition count 45
Applied a total of 14 rules in 1 ms. Remains 62 /76 variables (removed 14) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:03:32] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:03:32] [INFO ] Implicit Places using invariants in 46 ms returned [9, 12, 13, 16, 21, 26, 27, 28, 29, 31, 32]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 47 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/76 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 51/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(AND (EQ s7 1) (EQ s42 1)), p0:(AND (EQ s21 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3236 reset in 65 ms.
Product exploration explored 100000 steps with 3235 reset in 70 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 (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 41 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 45 rows 51 cols
[2022-05-17 00:03:33] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 00:03:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 00:03:33] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:33] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 00:03:33] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:03:33] [INFO ] Added : 39 causal constraints over 8 iterations in 50 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 51 cols
[2022-05-17 00:03:33] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 00:03:33] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 45 rows 51 cols
[2022-05-17 00:03:33] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 00:03:33] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 51 cols
[2022-05-17 00:03:33] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 00:03:33] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 41 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 45 rows 51 cols
[2022-05-17 00:03:34] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 00:03:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 00:03:34] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-17 00:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:03:34] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:03:34] [INFO ] Added : 39 causal constraints over 8 iterations in 49 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3235 reset in 63 ms.
Product exploration explored 100000 steps with 3234 reset in 67 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 45/45 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 51 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 19 place count 51 transition count 45
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 30 place count 51 transition count 45
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 50 transition count 45
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 51 place count 31 transition count 26
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 70 place count 31 transition count 26
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 31 transition count 26
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 27 transition count 22
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 27 transition count 22
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 84 rules in 7 ms. Remains 27 /51 variables (removed 24) and now considering 22/45 (removed 23) transitions.
[2022-05-17 00:03:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 27 cols
[2022-05-17 00:03:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:03:35] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/51 places, 22/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/51 places, 22/45 transitions.
Product exploration explored 100000 steps with 14285 reset in 81 ms.
Product exploration explored 100000 steps with 14285 reset in 91 ms.
Built C files in :
/tmp/ltsmin16356091235342555586
[2022-05-17 00:03:35] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16356091235342555586
Running compilation step : cd /tmp/ltsmin16356091235342555586;'/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 1485 ms.
Running link step : cd /tmp/ltsmin16356091235342555586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16356091235342555586;'/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/stateBased5480033216675191310.hoa' '--buchi-type=spotba'
LTSmin run took 187 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-15 finished in 4595 ms.
All properties solved by simple procedures.
Total runtime 24366 ms.

BK_STOP 1652745817275

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

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