Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r265-smll-167863540000396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ParamProductionCell-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540000396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 9.3K Feb 26 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 17:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 17:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678992972730

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 18:56:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 18:56:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:56:15] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2023-03-16 18:56:15] [INFO ] Transformed 231 places.
[2023-03-16 18:56:15] [INFO ] Transformed 202 transitions.
[2023-03-16 18:56:15] [INFO ] Found NUPN structural information;
[2023-03-16 18:56:15] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 9 formulas.
FORMULA ParamProductionCell-PT-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 65 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2023-03-16 18:56:16] [INFO ] Computed 59 place invariants in 14 ms
[2023-03-16 18:56:16] [INFO ] Implicit Places using invariants in 662 ms returned [15, 16, 18, 24, 31, 35, 36, 41, 42, 46, 47, 59, 64, 65, 73, 78, 79, 114, 115, 117, 119, 120, 161, 162, 166, 167, 192, 193, 196, 197, 202, 203, 207, 218]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 728 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/231 places, 198/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 800 ms. Remains : 193/231 places, 198/202 transitions.
Support contains 27 out of 193 places after structural reductions.
[2023-03-16 18:56:17] [INFO ] Flatten gal took : 71 ms
[2023-03-16 18:56:17] [INFO ] Flatten gal took : 28 ms
[2023-03-16 18:56:17] [INFO ] Input system was already deterministic with 198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 193 cols
[2023-03-16 18:56:17] [INFO ] Computed 25 place invariants in 4 ms
[2023-03-16 18:56:17] [INFO ] [Real]Absence check using 20 positive place invariants in 38 ms returned sat
[2023-03-16 18:56:18] [INFO ] [Real]Absence check using 20 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-16 18:56:18] [INFO ] After 233ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((!p0||(X(!p1) U ((X(!p1)&&G(!p0))||X(G(!p1)))))))) U (X(X(G((!p0||(X(!p1) U ((X(!p1)&&G(!p0))||X(G(!p1))))))))&&p2))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 196
Applied a total of 4 rules in 19 ms. Remains 191 /193 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 191 cols
[2023-03-16 18:56:18] [INFO ] Computed 25 place invariants in 4 ms
[2023-03-16 18:56:18] [INFO ] Implicit Places using invariants in 300 ms returned [16, 81, 82, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 307 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/193 places, 196/198 transitions.
Applied a total of 0 rules in 16 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 346 ms. Remains : 187/193 places, 196/198 transitions.
Stuttering acceptance computed with spot in 642 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p0 p1), (AND p0 (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1} source=5 dest: 7}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 7}, { cond=(NOT p0), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (EQ s92 1) (EQ s115 1)), p0:(AND (EQ s92 1) (EQ s115 1)), p1:(AND (EQ s81 1) (EQ s84 1) (EQ s107 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 807 reset in 372 ms.
Product exploration explored 100000 steps with 808 reset in 247 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 (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 10 states, 24 edges and 3 AP (stutter sensitive) to 10 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p0 p1), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 187 cols
[2023-03-16 18:56:20] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-16 18:56:20] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-16 18:56:20] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 18:56:20] [INFO ] After 91ms 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 p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 504 ms. Reduced automaton from 10 states, 24 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
[2023-03-16 18:56:22] [INFO ] Invariant cache hit.
[2023-03-16 18:56:22] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-16 18:56:22] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-16 18:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 18:56:22] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-16 18:56:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 18:56:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-16 18:56:22] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 18:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 18:56:23] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2023-03-16 18:56:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 18:56:23] [INFO ] [Nat]Added 68 Read/Feed constraints in 17 ms returned sat
[2023-03-16 18:56:23] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 5 ms to minimize.
[2023-03-16 18:56:23] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2023-03-16 18:56:23] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2023-03-16 18:56:23] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2023-03-16 18:56:23] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2023-03-16 18:56:23] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2023-03-16 18:56:23] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2023-03-16 18:56:23] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-16 18:56:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 891 ms
[2023-03-16 18:56:23] [INFO ] Computed and/alt/rep : 185/325/185 causal constraints (skipped 7 transitions) in 19 ms.
[2023-03-16 18:56:24] [INFO ] Added : 179 causal constraints over 36 iterations in 909 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-16 18:56:24] [INFO ] Invariant cache hit.
[2023-03-16 18:56:24] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-16 18:56:24] [INFO ] Invariant cache hit.
[2023-03-16 18:56:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 18:56:25] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2023-03-16 18:56:25] [INFO ] Invariant cache hit.
[2023-03-16 18:56:25] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 912 ms. Remains : 187/187 places, 196/196 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 p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 368 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :3
Finished Best-First random walk after 469 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=234 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 341 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 565 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
[2023-03-16 18:56:27] [INFO ] Invariant cache hit.
[2023-03-16 18:56:28] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-16 18:56:28] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-16 18:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 18:56:28] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2023-03-16 18:56:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 18:56:28] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-16 18:56:28] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 18:56:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 18:56:28] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2023-03-16 18:56:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 18:56:28] [INFO ] [Nat]Added 68 Read/Feed constraints in 18 ms returned sat
[2023-03-16 18:56:28] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-16 18:56:29] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-16 18:56:29] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-16 18:56:29] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-16 18:56:29] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 0 ms to minimize.
[2023-03-16 18:56:29] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2023-03-16 18:56:29] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2023-03-16 18:56:29] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-16 18:56:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 973 ms
[2023-03-16 18:56:29] [INFO ] Computed and/alt/rep : 185/325/185 causal constraints (skipped 7 transitions) in 17 ms.
[2023-03-16 18:56:30] [INFO ] Added : 179 causal constraints over 36 iterations in 878 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 484 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Product exploration explored 100000 steps with 1436 reset in 219 ms.
Product exploration explored 100000 steps with 1431 reset in 211 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, false, false, true]
Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 187 transition count 196
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 36 place count 187 transition count 198
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 49 place count 187 transition count 198
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 177 transition count 187
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 177 transition count 187
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 104 place count 177 transition count 187
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 128 place count 153 transition count 163
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 152 place count 153 transition count 163
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 152 rules in 59 ms. Remains 153 /187 variables (removed 34) and now considering 163/196 (removed 33) transitions.
[2023-03-16 18:56:32] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 163 rows 153 cols
[2023-03-16 18:56:32] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-16 18:56:33] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/187 places, 163/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 584 ms. Remains : 153/187 places, 163/196 transitions.
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 187 cols
[2023-03-16 18:56:33] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-16 18:56:33] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-16 18:56:33] [INFO ] Invariant cache hit.
[2023-03-16 18:56:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 18:56:34] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2023-03-16 18:56:34] [INFO ] Invariant cache hit.
[2023-03-16 18:56:34] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1221 ms. Remains : 187/187 places, 196/196 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-00 finished in 16156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 196
Applied a total of 4 rules in 21 ms. Remains 191 /193 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 191 cols
[2023-03-16 18:56:34] [INFO ] Computed 25 place invariants in 5 ms
[2023-03-16 18:56:35] [INFO ] Implicit Places using invariants in 668 ms returned [16, 81, 82, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 670 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/193 places, 196/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 695 ms. Remains : 187/193 places, 196/198 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s79 1) (EQ s81 1) (EQ s106 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 578 reset in 162 ms.
Stack based approach found an accepted trace after 904 steps with 8 reset with depth 231 and stack size 231 in 4 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-05 finished in 970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 193 transition count 160
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 155 transition count 160
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 76 place count 155 transition count 149
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 98 place count 144 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 142 transition count 147
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 142 transition count 147
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 160 place count 113 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 111 transition count 116
Applied a total of 164 rules in 29 ms. Remains 111 /193 variables (removed 82) and now considering 116/198 (removed 82) transitions.
// Phase 1: matrix 116 rows 111 cols
[2023-03-16 18:56:35] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-16 18:56:35] [INFO ] Implicit Places using invariants in 119 ms returned [7, 40, 41, 43, 80]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 121 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/193 places, 116/198 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 106 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 115
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 103 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 103 transition count 113
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 42 place count 85 transition count 95
Applied a total of 42 rules in 12 ms. Remains 85 /106 variables (removed 21) and now considering 95/116 (removed 21) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-16 18:56:35] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 18:56:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-16 18:56:35] [INFO ] Invariant cache hit.
[2023-03-16 18:56:35] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 18:56:35] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/193 places, 95/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 437 ms. Remains : 85/193 places, 95/198 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-06 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 (EQ s75 1) (EQ s79 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 143 ms.
Stack based approach found an accepted trace after 91 steps with 0 reset with depth 92 and stack size 92 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-06 finished in 636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 193 transition count 161
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 156 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 155 transition count 160
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 76 place count 155 transition count 149
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 98 place count 144 transition count 149
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 142 transition count 147
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 142 transition count 147
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 160 place count 113 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 111 transition count 116
Applied a total of 164 rules in 32 ms. Remains 111 /193 variables (removed 82) and now considering 116/198 (removed 82) transitions.
// Phase 1: matrix 116 rows 111 cols
[2023-03-16 18:56:36] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-16 18:56:36] [INFO ] Implicit Places using invariants in 126 ms returned [42, 44, 81]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 127 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/193 places, 116/198 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 94 transition count 102
Applied a total of 28 rules in 9 ms. Remains 94 /108 variables (removed 14) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 94 cols
[2023-03-16 18:56:36] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-16 18:56:36] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-16 18:56:36] [INFO ] Invariant cache hit.
[2023-03-16 18:56:36] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 18:56:36] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/193 places, 102/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 518 ms. Remains : 94/193 places, 102/198 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-08 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=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s11 1)), p0:(AND (EQ s41 1) (EQ s45 1) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 183 reset in 165 ms.
Stack based approach found an accepted trace after 95 steps with 0 reset with depth 96 and stack size 96 in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-08 finished in 777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(p0)||X(G(p1))))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 197
Applied a total of 2 rules in 8 ms. Remains 192 /193 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 192 cols
[2023-03-16 18:56:36] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-16 18:56:36] [INFO ] Implicit Places using invariants in 158 ms returned [16, 81, 139]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 159 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/193 places, 197/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 189/193 places, 197/198 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s131 1)), p1:(OR (EQ s80 0) (EQ s103 0))], 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]]
Product exploration explored 100000 steps with 16735 reset in 157 ms.
Product exploration explored 100000 steps with 16674 reset in 182 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 3397 steps, including 1 resets, run visited all 2 properties in 18 ms. (steps per millisecond=188 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 189 cols
[2023-03-16 18:56:38] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-16 18:56:38] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-16 18:56:38] [INFO ] Invariant cache hit.
[2023-03-16 18:56:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 18:56:39] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2023-03-16 18:56:39] [INFO ] Invariant cache hit.
[2023-03-16 18:56:39] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 714 ms. Remains : 189/189 places, 197/197 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 868 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=173 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 16663 reset in 143 ms.
Product exploration explored 100000 steps with 16705 reset in 170 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 197/197 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 197
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 34 place count 189 transition count 199
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 47 place count 189 transition count 199
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 179 transition count 188
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 179 transition count 188
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 99 place count 179 transition count 188
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 122 place count 156 transition count 165
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 145 place count 156 transition count 165
Deduced a syphon composed of 46 places in 0 ms
Applied a total of 145 rules in 25 ms. Remains 156 /189 variables (removed 33) and now considering 165/197 (removed 32) transitions.
[2023-03-16 18:56:40] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 165 rows 156 cols
[2023-03-16 18:56:40] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 18:56:41] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/189 places, 165/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 156/189 places, 165/197 transitions.
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 189 cols
[2023-03-16 18:56:41] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-16 18:56:41] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-16 18:56:41] [INFO ] Invariant cache hit.
[2023-03-16 18:56:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 18:56:41] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2023-03-16 18:56:41] [INFO ] Invariant cache hit.
[2023-03-16 18:56:41] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 189/189 places, 197/197 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-09 finished in 5089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 197
Applied a total of 2 rules in 3 ms. Remains 192 /193 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 192 cols
[2023-03-16 18:56:41] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-16 18:56:42] [INFO ] Implicit Places using invariants in 130 ms returned [16, 82, 84, 139]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 132 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/193 places, 197/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 188/193 places, 197/198 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s80 1) (EQ s86 1)), p0:(AND (EQ s78 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22 reset in 141 ms.
Stack based approach found an accepted trace after 213 steps with 0 reset with depth 214 and stack size 214 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-13 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(p1 U p2)))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 196
Applied a total of 4 rules in 3 ms. Remains 191 /193 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 191 cols
[2023-03-16 18:56:42] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-16 18:56:42] [INFO ] Implicit Places using invariants in 137 ms returned [16, 81, 84, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 138 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/193 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-16 18:56:42] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 18:56:42] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-16 18:56:42] [INFO ] Invariant cache hit.
[2023-03-16 18:56:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 18:56:43] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/193 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 650 ms. Remains : 185/193 places, 194/198 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s6 1) (EQ s115 1)), p1:(AND (EQ s80 1) (EQ s102 1)), p0:(AND (EQ s2 1) (EQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-14 finished in 850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((!p0||(X(!p1) U ((X(!p1)&&G(!p0))||X(G(!p1)))))))) U (X(X(G((!p0||(X(!p1) U ((X(!p1)&&G(!p0))||X(G(!p1))))))))&&p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(p0)||X(G(p1))))))))'
Found a Lengthening insensitive property : ParamProductionCell-PT-4-LTLFireability-09
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 193 transition count 159
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 154 transition count 159
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 78 place count 154 transition count 149
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 98 place count 144 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 143 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 143 transition count 148
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 160 place count 113 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 111 transition count 116
Applied a total of 164 rules in 17 ms. Remains 111 /193 variables (removed 82) and now considering 116/198 (removed 82) transitions.
// Phase 1: matrix 116 rows 111 cols
[2023-03-16 18:56:43] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-16 18:56:43] [INFO ] Implicit Places using invariants in 117 ms returned [7, 40, 81]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 144 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 108/193 places, 116/198 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 108 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 115
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 105 transition count 113
Applied a total of 6 rules in 8 ms. Remains 105 /108 variables (removed 3) and now considering 113/116 (removed 3) transitions.
// Phase 1: matrix 113 rows 105 cols
[2023-03-16 18:56:43] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-16 18:56:43] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-16 18:56:43] [INFO ] Invariant cache hit.
[2023-03-16 18:56:44] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 18:56:44] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 105/193 places, 113/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 535 ms. Remains : 105/193 places, 113/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s40 1) (EQ s73 1)), p1:(OR (EQ s38 0) (EQ s55 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16718 reset in 141 ms.
Product exploration explored 100000 steps with 16633 reset in 160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 188 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 113/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-16 18:56:45] [INFO ] Invariant cache hit.
[2023-03-16 18:56:45] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-16 18:56:45] [INFO ] Invariant cache hit.
[2023-03-16 18:56:45] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 18:56:45] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2023-03-16 18:56:45] [INFO ] Invariant cache hit.
[2023-03-16 18:56:45] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 105/105 places, 113/113 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 345 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 16625 reset in 134 ms.
Product exploration explored 100000 steps with 16705 reset in 162 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 113/113 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-16 18:56:47] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 18:56:47] [INFO ] Invariant cache hit.
[2023-03-16 18:56:47] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 105/105 places, 113/113 transitions.
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 113/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-16 18:56:48] [INFO ] Invariant cache hit.
[2023-03-16 18:56:48] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-16 18:56:48] [INFO ] Invariant cache hit.
[2023-03-16 18:56:48] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 18:56:48] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-16 18:56:48] [INFO ] Invariant cache hit.
[2023-03-16 18:56:48] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 105/105 places, 113/113 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-09 finished in 5183 ms.
[2023-03-16 18:56:48] [INFO ] Flatten gal took : 19 ms
[2023-03-16 18:56:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-16 18:56:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 198 transitions and 668 arcs took 3 ms.
Total runtime 33158 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1697/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1697/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ParamProductionCell-PT-4-LTLFireability-00
Could not compute solution for formula : ParamProductionCell-PT-4-LTLFireability-09

BK_STOP 1678993010398

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ParamProductionCell-PT-4-LTLFireability-00
ltl formula formula --ltl=/tmp/1697/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 193 places, 198 transitions and 668 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1697/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1697/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1697/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1697/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ParamProductionCell-PT-4-LTLFireability-09
ltl formula formula --ltl=/tmp/1697/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 193 places, 198 transitions and 668 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1697/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1697/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.010 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1697/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1697/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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="ParamProductionCell-PT-4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ParamProductionCell-PT-4, 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 r265-smll-167863540000396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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