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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 8.8K Apr 29 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 29 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 29 18:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 18:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 13 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 60K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652745919754

Running Version 202205111006
[2022-05-17 00:05:21] [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:05:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:05:21] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2022-05-17 00:05:21] [INFO ] Transformed 111 places.
[2022-05-17 00:05:21] [INFO ] Transformed 45 transitions.
[2022-05-17 00:05:21] [INFO ] Parsed PT model containing 111 places and 45 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 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 17 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 89 transition count 45
Applied a total of 22 rules in 13 ms. Remains 89 /111 variables (removed 22) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 89 cols
[2022-05-17 00:05:21] [INFO ] Computed 45 place invariants in 11 ms
[2022-05-17 00:05:21] [INFO ] Implicit Places using invariants in 148 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 88/111 places, 45/45 transitions.
Support contains 58 out of 88 places after structural reductions.
[2022-05-17 00:05:21] [INFO ] Flatten gal took : 25 ms
[2022-05-17 00:05:21] [INFO ] Flatten gal took : 10 ms
[2022-05-17 00:05:21] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 824 steps, including 0 resets, run visited all 27 properties in 71 ms. (steps per millisecond=11 )
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(X((p0||(X(p2)&&p1)))))))'
Support contains 8 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 69 transition count 45
Applied a total of 19 rules in 3 ms. Remains 69 /88 variables (removed 19) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 69 cols
[2022-05-17 00:05:22] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-17 00:05:22] [INFO ] Implicit Places using invariants in 72 ms returned [10, 15, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/88 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1)), p0:(AND (GEQ s5 1) (GEQ s13 1) (GEQ s14 1) (GEQ s21 1) (GEQ s63 1)), p2:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 815 reset in 244 ms.
Product exploration explored 100000 steps with 806 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 524 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 140 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 440 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:05:24] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-17 00:05:24] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:05:24] [INFO ] [Real]Absence check using 16 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 00:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:05:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 00:05:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:05:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:05:24] [INFO ] [Nat]Absence check using 16 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 00:05:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:05:24] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-17 00:05:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:05:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:05:24] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:05:24] [INFO ] Added : 36 causal constraints over 8 iterations in 52 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:05:24] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:05:24] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:05:24] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:05:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:05:24] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:05:24] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-17 00:05:24] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 399 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 135 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 432 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:05:26] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:05:26] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:05:26] [INFO ] [Real]Absence check using 16 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 00:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:05:26] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 00:05:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:05:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:05:26] [INFO ] [Nat]Absence check using 16 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 00:05:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:05:26] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-17 00:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:05:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:05:26] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 00:05:26] [INFO ] Added : 36 causal constraints over 8 iterations in 59 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 817 reset in 156 ms.
Product exploration explored 100000 steps with 809 reset in 185 ms.
Built C files in :
/tmp/ltsmin16346511100716333616
[2022-05-17 00:05:26] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16346511100716333616
Running compilation step : cd /tmp/ltsmin16346511100716333616;'/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 205 ms.
Running link step : cd /tmp/ltsmin16346511100716333616;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16346511100716333616;'/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/stateBased5051689687219197799.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:05:42] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:05:42] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:05:42] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-17 00:05:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:05:42] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:05:42] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:05:42] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin5680945393888768782
[2022-05-17 00:05:42] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5680945393888768782
Running compilation step : cd /tmp/ltsmin5680945393888768782;'/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 111 ms.
Running link step : cd /tmp/ltsmin5680945393888768782;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5680945393888768782;'/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/stateBased17326780169123126628.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 00:05:57] [INFO ] Flatten gal took : 5 ms
[2022-05-17 00:05:57] [INFO ] Flatten gal took : 4 ms
[2022-05-17 00:05:57] [INFO ] Time to serialize gal into /tmp/LTL10669056651684125180.gal : 5 ms
[2022-05-17 00:05:57] [INFO ] Time to serialize properties into /tmp/LTL9201025130204858604.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10669056651684125180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9201025130204858604.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1066905...267
Read 1 LTL properties
Checking formula 0 : !((G(F(F(X(("((((Delivery_p22_8>=1)&&(Order_p22_10>=1))&&((Organization_p22_9>=1)&&(Status_p22_11>=1)))&&(p8_1>=1))")||(((X("(Consumer...249
Formula 0 simplified : !GFX("((((Delivery_p22_8>=1)&&(Order_p22_10>=1))&&((Organization_p22_9>=1)&&(Status_p22_11>=1)))&&(p8_1>=1))" | ("(DeliveryHandlerDe...231
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-17 00:06:12] [INFO ] Flatten gal took : 4 ms
[2022-05-17 00:06:12] [INFO ] Applying decomposition
[2022-05-17 00:06:12] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12365434307300332557.txt' '-o' '/tmp/graph12365434307300332557.bin' '-w' '/tmp/graph12365434307300332557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12365434307300332557.bin' '-l' '-1' '-v' '-w' '/tmp/graph12365434307300332557.weights' '-q' '0' '-e' '0.001'
[2022-05-17 00:06:12] [INFO ] Decomposing Gal with order
[2022-05-17 00:06:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 00:06:12] [INFO ] Flatten gal took : 35 ms
[2022-05-17 00:06:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-17 00:06:12] [INFO ] Time to serialize gal into /tmp/LTL2783081074929524402.gal : 1 ms
[2022-05-17 00:06:12] [INFO ] Time to serialize properties into /tmp/LTL12109581600108170320.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2783081074929524402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12109581600108170320.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2783081...246
Read 1 LTL properties
Checking formula 0 : !((G(F(F(X(("((((i1.u28.Delivery_p22_8>=1)&&(i1.u28.Order_p22_10>=1))&&((i1.u28.Organization_p22_9>=1)&&(i1.u4.Status_p22_11>=1)))&&(i...302
Formula 0 simplified : !GFX("((((i1.u28.Delivery_p22_8>=1)&&(i1.u28.Order_p22_10>=1))&&((i1.u28.Organization_p22_9>=1)&&(i1.u4.Status_p22_11>=1)))&&(i1.u28...284
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1603 unique states visited
0 strongly connected components in search stack
1813 transitions explored
213 items max in DFS search stack
1069 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.7139,245052,1,0,439113,3169,706,726255,226,17950,335729
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-00 finished in 62516 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(X((!(p0 U !X(p1))||p2)))))))'
Support contains 9 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 72 transition count 45
Applied a total of 16 rules in 10 ms. Remains 72 /88 variables (removed 16) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 72 cols
[2022-05-17 00:06:24] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-17 00:06:24] [INFO ] Implicit Places using invariants in 50 ms returned [10, 16, 20, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/88 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 68/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s67 1), p0:(AND (GEQ s5 1) (GEQ s13 1) (GEQ s14 1) (GEQ s17 1) (GEQ s22 1) (GEQ s25 1)), p1:(AND (GEQ s8 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5390 reset in 136 ms.
Product exploration explored 100000 steps with 5404 reset in 132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 314 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Finished random walk after 397 steps, including 0 resets, run visited all 5 properties in 13 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F p2), (F (AND p1 (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 410 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 45 rows 68 cols
[2022-05-17 00:06:26] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-17 00:06:26] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 00:06:26] [INFO ] [Real]Absence check using 15 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 00:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:06:26] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-05-17 00:06:26] [INFO ] Computed and/alt/rep : 44/51/44 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 00:06:26] [INFO ] Added : 39 causal constraints over 8 iterations in 57 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 68 cols
[2022-05-17 00:06:26] [INFO ] Computed 24 place invariants in 0 ms
[2022-05-17 00:06:26] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 45 rows 68 cols
[2022-05-17 00:06:26] [INFO ] Computed 24 place invariants in 0 ms
[2022-05-17 00:06:26] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 68 cols
[2022-05-17 00:06:26] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-17 00:06:26] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 309 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Finished random walk after 1144 steps, including 0 resets, run visited all 5 properties in 15 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F p2), (F (AND p1 (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 350 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 45 rows 68 cols
[2022-05-17 00:06:27] [INFO ] Computed 24 place invariants in 4 ms
[2022-05-17 00:06:27] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 00:06:27] [INFO ] [Real]Absence check using 15 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 00:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:06:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 00:06:27] [INFO ] Computed and/alt/rep : 44/51/44 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 00:06:28] [INFO ] Added : 39 causal constraints over 8 iterations in 61 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5368 reset in 116 ms.
Product exploration explored 100000 steps with 5389 reset in 125 ms.
Built C files in :
/tmp/ltsmin9279666550750493621
[2022-05-17 00:06:28] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9279666550750493621
Running compilation step : cd /tmp/ltsmin9279666550750493621;'/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 128 ms.
Running link step : cd /tmp/ltsmin9279666550750493621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9279666550750493621;'/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/stateBased4816236318567102351.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 68 cols
[2022-05-17 00:06:43] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-17 00:06:43] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 45 rows 68 cols
[2022-05-17 00:06:43] [INFO ] Computed 24 place invariants in 0 ms
[2022-05-17 00:06:43] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 68 cols
[2022-05-17 00:06:43] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-17 00:06:43] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin4184752854641779549
[2022-05-17 00:06:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4184752854641779549
Running compilation step : cd /tmp/ltsmin4184752854641779549;'/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 121 ms.
Running link step : cd /tmp/ltsmin4184752854641779549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin4184752854641779549;'/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/stateBased8773619419897859631.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 00:06:58] [INFO ] Flatten gal took : 3 ms
[2022-05-17 00:06:58] [INFO ] Flatten gal took : 3 ms
[2022-05-17 00:06:58] [INFO ] Time to serialize gal into /tmp/LTL16267901684982789565.gal : 2 ms
[2022-05-17 00:06:58] [INFO ] Time to serialize properties into /tmp/LTL5012219692036463617.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16267901684982789565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5012219692036463617.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1626790...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(X((!(("((((Delivery_p20_10>=1)&&(Order_p20_8>=1))&&((Organization_p20_7>=1)&&(Payment_p20_9>=1)))&&((Status_p20_6>=1)&&(p1_...239
Formula 0 simplified : !XGXFX("(p8_3>=1)" | !("((((Delivery_p20_10>=1)&&(Order_p20_8>=1))&&((Organization_p20_7>=1)&&(Payment_p20_9>=1)))&&((Status_p20_6>=...220
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-17 00:07:13] [INFO ] Flatten gal took : 3 ms
[2022-05-17 00:07:13] [INFO ] Applying decomposition
[2022-05-17 00:07:13] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1519251174896232104.txt' '-o' '/tmp/graph1519251174896232104.bin' '-w' '/tmp/graph1519251174896232104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1519251174896232104.bin' '-l' '-1' '-v' '-w' '/tmp/graph1519251174896232104.weights' '-q' '0' '-e' '0.001'
[2022-05-17 00:07:13] [INFO ] Decomposing Gal with order
[2022-05-17 00:07:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 00:07:13] [INFO ] Flatten gal took : 5 ms
[2022-05-17 00:07:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 00:07:13] [INFO ] Time to serialize gal into /tmp/LTL283937980127103818.gal : 1 ms
[2022-05-17 00:07:13] [INFO ] Time to serialize properties into /tmp/LTL6744106380758282064.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL283937980127103818.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6744106380758282064.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2839379...244
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(X((!(("((((i3.u16.Delivery_p20_10>=1)&&(i3.u16.Order_p20_8>=1))&&((i3.u16.Organization_p20_7>=1)&&(i3.u16.Payment_p20_9>=1)...300
Formula 0 simplified : !XGXFX("(i8.u27.p8_3>=1)" | !("((((i3.u16.Delivery_p20_10>=1)&&(i3.u16.Order_p20_8>=1))&&((i3.u16.Organization_p20_7>=1)&&(i3.u16.Pa...281
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5498 unique states visited
0 strongly connected components in search stack
10564 transitions explored
206 items max in DFS search stack
1239 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.4001,275028,1,0,580067,7077,676,593332,359,45561,595680
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-01 finished in 63315 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(!X(p0) U !(X(p1)||G(p0)||p0)))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 67 transition count 45
Applied a total of 21 rules in 7 ms. Remains 67 /88 variables (removed 21) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2022-05-17 00:07:28] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-17 00:07:28] [INFO ] Implicit Places using invariants in 55 ms returned [9, 13, 16, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/88 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s42 1)), p1:(GEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2509 reset in 115 ms.
Product exploration explored 100000 steps with 2486 reset in 133 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 70 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 298 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:29] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 00:07:29] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 00:07:29] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 00:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:29] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 00:07:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:07:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 00:07:29] [INFO ] [Nat]Absence check using 15 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 00:07:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:29] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:07:29] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:07:29] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 8 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:29] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 00:07:29] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:29] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 00:07:29] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:29] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 00:07:29] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 82 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:30] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-17 00:07:30] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 00:07:30] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 00:07:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 00:07:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:07:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 00:07:30] [INFO ] [Nat]Absence check using 15 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 00:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:30] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 00:07:30] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:07:30] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2500 reset in 116 ms.
Product exploration explored 100000 steps with 2492 reset in 124 ms.
Built C files in :
/tmp/ltsmin4573529516296610700
[2022-05-17 00:07:31] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4573529516296610700
Running compilation step : cd /tmp/ltsmin4573529516296610700;'/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 122 ms.
Running link step : cd /tmp/ltsmin4573529516296610700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4573529516296610700;'/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/stateBased11175663193968501672.hoa' '--buchi-type=spotba'
LTSmin run took 70 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-02 finished in 3496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(p0)))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 29 place count 55 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 37 place count 47 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 37 place count 47 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 65 place count 30 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 65 place count 30 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 27 transition count 16
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 86 place count 18 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 17 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 place count 17 transition count 9
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 89 place count 16 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 91 place count 15 transition count 8
Applied a total of 91 rules in 17 ms. Remains 15 /88 variables (removed 73) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 15 cols
[2022-05-17 00:07:31] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 00:07:31] [INFO ] Implicit Places using invariants in 35 ms returned [2, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/88 places, 8/45 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 12 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 11 transition count 6
Applied a total of 4 rules in 4 ms. Remains 11 /13 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 11 cols
[2022-05-17 00:07:31] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:07:31] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 11 cols
[2022-05-17 00:07:31] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:07:31] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/88 places, 6/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/88 places, 6/45 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s7 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-03 finished in 286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X(F((X(p1)&&p0)))&&F(p1))))))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 67 transition count 45
Applied a total of 21 rules in 8 ms. Remains 67 /88 variables (removed 21) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2022-05-17 00:07:31] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-17 00:07:31] [INFO ] Implicit Places using invariants in 41 ms returned [9, 13, 16, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/88 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s38 1)), p1:(AND (GEQ s0 1) (GEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2448 reset in 109 ms.
Product exploration explored 100000 steps with 2461 reset in 138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:32] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-17 00:07:32] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 353 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:33] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 00:07:33] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:07:33] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:33] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:07:33] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:07:33] [INFO ] Added : 10 causal constraints over 2 iterations in 19 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:33] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-17 00:07:33] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:07:33] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-17 00:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:33] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 00:07:33] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:07:33] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:33] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-17 00:07:33] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:33] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-17 00:07:33] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:33] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-17 00:07:33] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 30 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:34] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-17 00:07:34] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:07:34] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:07:34] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:07:34] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:07:34] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-17 00:07:34] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:07:34] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:07:34] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:07:34] [INFO ] Added : 10 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2485 reset in 128 ms.
Product exploration explored 100000 steps with 2491 reset in 122 ms.
Built C files in :
/tmp/ltsmin5108002857096342756
[2022-05-17 00:07:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5108002857096342756
Running compilation step : cd /tmp/ltsmin5108002857096342756;'/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 101 ms.
Running link step : cd /tmp/ltsmin5108002857096342756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin5108002857096342756;'/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/stateBased8981894011855088583.hoa' '--buchi-type=spotba'
LTSmin run took 276 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-05 finished in 3686 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(((F(p1)&&p0) U p2))))))'
Support contains 8 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 71 transition count 45
Applied a total of 17 rules in 2 ms. Remains 71 /88 variables (removed 17) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 71 cols
[2022-05-17 00:07:35] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-17 00:07:35] [INFO ] Implicit Places using invariants in 36 ms returned [11, 16, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/88 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 68/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s14 1) (GEQ s15 1) (GEQ s22 1) (GEQ s65 1)), p0:(AND (GEQ s5 1) (GEQ s14 1) (GEQ s15 1) (GEQ s22 1) (GEQ s65 1)), p1:(AND (GEQ s7 ...], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-07 finished in 298 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((X(p0) U p1)||p1))))'
Support contains 6 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 71 transition count 45
Applied a total of 17 rules in 2 ms. Remains 71 /88 variables (removed 17) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 71 cols
[2022-05-17 00:07:35] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-17 00:07:35] [INFO ] Implicit Places using invariants in 41 ms returned [16, 20, 26]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/88 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 68/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s14 1) (GEQ s15 1) (GEQ s18 1) (GEQ s23 1) (GEQ s26 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 7476 reset in 121 ms.
Product exploration explored 100000 steps with 7416 reset in 158 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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 113 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 p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
// Phase 1: matrix 45 rows 68 cols
[2022-05-17 00:07:36] [INFO ] Computed 24 place invariants in 0 ms
[2022-05-17 00:07:36] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:07:36] [INFO ] [Real]Absence check using 16 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 00:07:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:36] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 00:07:36] [INFO ] Computed and/alt/rep : 44/51/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:07:36] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 68 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 : 68/68 places, 45/45 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 0 with 5 rules applied. Total rules applied 5 place count 68 transition count 40
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 19 place count 60 transition count 34
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 26 place count 54 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 53 transition count 33
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 27 place count 53 transition count 21
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 55 place count 37 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 55 place count 37 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 61 place count 34 transition count 18
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 82 place count 21 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 20 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 83 place count 20 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 86 place count 18 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 18 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 89 place count 16 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 89 place count 16 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 91 place count 15 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 96 place count 12 transition count 5
Applied a total of 96 rules in 5 ms. Remains 12 /68 variables (removed 56) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 12 cols
[2022-05-17 00:07:36] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 00:07:36] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 5 rows 12 cols
[2022-05-17 00:07:36] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 00:07:36] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-17 00:07:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 12 cols
[2022-05-17 00:07:36] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 00:07:36] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/68 places, 5/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/68 places, 5/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-08 finished in 1124 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 29 place count 55 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 37 place count 47 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 37 place count 47 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 65 place count 30 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 65 place count 30 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 27 transition count 16
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 89 place count 16 transition count 9
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 14 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 91 place count 14 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 96 place count 11 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 100 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 102 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 102 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 104 place count 6 transition count 4
Applied a total of 104 rules in 7 ms. Remains 6 /88 variables (removed 82) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-17 00:07:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 00:07:36] [INFO ] Implicit Places using invariants in 24 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/88 places, 4/45 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2 transition count 2
Applied a total of 4 rules in 3 ms. Remains 2 /4 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:07:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:07:36] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:07:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:07:36] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/88 places, 2/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/88 places, 2/45 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-09 finished in 295 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((F(X(p0))||G(p1))))||F(p1)))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 66 transition count 45
Applied a total of 22 rules in 2 ms. Remains 66 /88 variables (removed 22) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:07:37] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:07:37] [INFO ] Implicit Places using invariants in 42 ms returned [9, 13, 16, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/88 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), 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 (GEQ s26 1) (GEQ s44 1)), p0:(GEQ s43 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 3906 reset in 117 ms.
Product exploration explored 100000 steps with 3897 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 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 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 141 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 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:07:38] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:07:38] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:07:38] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-17 00:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:38] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:07:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:07:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:07:38] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:38] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 00:07:38] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:07:38] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:07:38] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-17 00:07:38] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:07:38] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:07:38] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:07:38] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-17 00:07:38] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 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 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 93 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 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:07:39] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-17 00:07:39] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:07:39] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-17 00:07:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:07:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:07:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:07:39] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:07:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:07:39] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:07:39] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 00:07:39] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3892 reset in 111 ms.
Product exploration explored 100000 steps with 3923 reset in 120 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 62 transition count 45
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 7 place count 62 transition count 45
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 22 place count 62 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 62 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 61 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 61 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 31 rules in 15 ms. Remains 61 /62 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2022-05-17 00:07:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 61 cols
[2022-05-17 00:07:39] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-17 00:07:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/62 places, 44/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 44/45 transitions.
Product exploration explored 100000 steps with 11812 reset in 197 ms.
Product exploration explored 100000 steps with 11780 reset in 196 ms.
Built C files in :
/tmp/ltsmin1749806793604263501
[2022-05-17 00:07:40] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1749806793604263501
Running compilation step : cd /tmp/ltsmin1749806793604263501;'/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 111 ms.
Running link step : cd /tmp/ltsmin1749806793604263501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1749806793604263501;'/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/stateBased15026552471298605119.hoa' '--buchi-type=spotba'
LTSmin run took 215 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-10 finished in 3359 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||p1))||F(X(p2))))'
Support contains 12 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 72 transition count 45
Applied a total of 16 rules in 2 ms. Remains 72 /88 variables (removed 16) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 72 cols
[2022-05-17 00:07:40] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-17 00:07:40] [INFO ] Implicit Places using invariants in 48 ms returned [11, 17, 20, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/88 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 68/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (GEQ s7 1) (GEQ s22 1) (GEQ s60 1)), p0:(OR (LT s31 1) (LT s49 1)), p1:(AND (OR (LT s5 1) (LT s14 1) (LT s15 1) (LT s36 1) (LT s63 1)) (OR (LT s9 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-11 finished in 697 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U X(((p1 U !p0)||p1)))&&X(p2)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 66 transition count 45
Applied a total of 22 rules in 2 ms. Remains 66 /88 variables (removed 22) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:07:41] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:07:41] [INFO ] Implicit Places using invariants in 40 ms returned [9, 13, 16, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/88 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (OR (NOT p0) (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (OR (NOT p0) p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LT s58 1), p1:(AND (GEQ s27 1) (GEQ s39 1)), p2:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-12 finished in 231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!((p0 U !p1) U p0))))'
Support contains 7 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 69 transition count 45
Applied a total of 19 rules in 1 ms. Remains 69 /88 variables (removed 19) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 69 cols
[2022-05-17 00:07:41] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 00:07:41] [INFO ] Implicit Places using invariants in 50 ms returned [10, 18, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/88 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 60 ms :[p0, p0]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s13 1) (GEQ s14 1) (GEQ s21 1) (GEQ s36 1) (GEQ s57 1)), p0:(GEQ s59 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 877 reset in 125 ms.
Product exploration explored 100000 steps with 870 reset in 132 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 (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Finished random walk after 170 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:07:42] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:07:42] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:07:42] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-17 00:07:42] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:07:42] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:07:42] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Finished random walk after 121 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Product exploration explored 100000 steps with 878 reset in 122 ms.
Product exploration explored 100000 steps with 875 reset in 134 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 45
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 8 place count 66 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 21 place count 66 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 66 transition count 45
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 26 rules in 8 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2022-05-17 00:07:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:07:43] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-17 00:07:43] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/66 places, 45/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 45/45 transitions.
Product exploration explored 100000 steps with 2411 reset in 148 ms.
Product exploration explored 100000 steps with 2436 reset in 187 ms.
Built C files in :
/tmp/ltsmin8634167845659804667
[2022-05-17 00:07:44] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8634167845659804667
Running compilation step : cd /tmp/ltsmin8634167845659804667;'/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 117 ms.
Running link step : cd /tmp/ltsmin8634167845659804667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8634167845659804667;'/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/stateBased4943786941325118114.hoa' '--buchi-type=spotba'
LTSmin run took 7381 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-13 finished in 10162 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(F(G(X(X((G(p0)&&p0))))))))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 69 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 29 place count 58 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 37 place count 50 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 37 place count 50 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 63 place count 34 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 63 place count 34 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 69 place count 31 transition count 17
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 30 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 73 place count 28 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 28 transition count 15
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 75 place count 27 transition count 15
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 8 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 89 place count 19 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 90 place count 18 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 90 place count 18 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 93 place count 16 transition count 8
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 94 place count 16 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 96 place count 14 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 96 place count 14 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 98 place count 13 transition count 6
Applied a total of 98 rules in 10 ms. Remains 13 /88 variables (removed 75) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 13 cols
[2022-05-17 00:07:51] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 00:07:51] [INFO ] Implicit Places using invariants in 23 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/88 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 12 transition count 4
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 9 transition count 4
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 2 with 2 rules applied. Total rules applied 7 place count 8 transition count 3
Applied a total of 7 rules in 2 ms. Remains 8 /12 variables (removed 4) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 8 cols
[2022-05-17 00:07:51] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:07:51] [INFO ] Implicit Places using invariants in 17 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/88 places, 3/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 3/3 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 7/88 places, 3/45 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s3 1) (LT s4 1) (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 104 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-14 finished in 200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(p1) U p1)&&p0))))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 66 transition count 45
Applied a total of 22 rules in 1 ms. Remains 66 /88 variables (removed 22) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:07:51] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-17 00:07:51] [INFO ] Implicit Places using invariants in 49 ms returned [9, 13, 16, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/88 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s30 1) (GEQ s51 1)), p1:(AND (GEQ s30 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-15 finished in 209 ms.
All properties solved by simple procedures.
Total runtime 151046 ms.

BK_STOP 1652746072194

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

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