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.r233-tall-167856418500196.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 JoinFreeModules-PT-0200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418500196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 992K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 613K Mar 5 18:22 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 JoinFreeModules-PT-0200-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679465061022

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=JoinFreeModules-PT-0200
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:04:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:04:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:04:22] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-22 06:04:22] [INFO ] Transformed 1001 places.
[2023-03-22 06:04:22] [INFO ] Transformed 1601 transitions.
[2023-03-22 06:04:22] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0200-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 101 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2023-03-22 06:04:23] [INFO ] Computed 200 place invariants in 24 ms
[2023-03-22 06:04:24] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
[2023-03-22 06:04:24] [INFO ] Invariant cache hit.
[2023-03-22 06:04:24] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-22 06:04:24] [INFO ] Invariant cache hit.
[2023-03-22 06:04:24] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:04:24] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2023-03-22 06:04:24] [INFO ] Invariant cache hit.
[2023-03-22 06:04:25] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2550 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 31 out of 1000 places after structural reductions.
[2023-03-22 06:04:25] [INFO ] Flatten gal took : 119 ms
[2023-03-22 06:04:25] [INFO ] Flatten gal took : 67 ms
[2023-03-22 06:04:26] [INFO ] Input system was already deterministic with 1601 transitions.
Support contains 30 out of 1000 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10102 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 29) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-22 06:04:26] [INFO ] Invariant cache hit.
[2023-03-22 06:04:27] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2023-03-22 06:04:27] [INFO ] After 1452ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2023-03-22 06:04:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 73 ms returned sat
[2023-03-22 06:04:31] [INFO ] After 2693ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2023-03-22 06:04:31] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:04:32] [INFO ] After 1588ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :1 sat :19
[2023-03-22 06:04:33] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 6 ms to minimize.
[2023-03-22 06:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-22 06:04:35] [INFO ] After 3783ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :19
Attempting to minimize the solution found.
Minimization took 1412 ms.
[2023-03-22 06:04:36] [INFO ] After 8625ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 20 Parikh solutions to 19 different solutions.
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=19 )
Parikh walk visited 19 properties in 21920 ms.
Successfully simplified 1 atomic propositions for a total of 14 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(F(p0))&&(p0||F(G(p1))))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 44 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:04:58] [INFO ] Invariant cache hit.
[2023-03-22 06:04:59] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
[2023-03-22 06:04:59] [INFO ] Invariant cache hit.
[2023-03-22 06:04:59] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-22 06:04:59] [INFO ] Invariant cache hit.
[2023-03-22 06:05:00] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:05:00] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2023-03-22 06:05:00] [INFO ] Invariant cache hit.
[2023-03-22 06:05:00] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2049 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s182 1), p1:(GEQ s847 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3236 ms.
Product exploration explored 100000 steps with 33333 reset in 3368 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 p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0200-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0200-LTLFireability-00 finished in 10700 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 U p1)||(F(p2)&&G(F(p3)))))))'
Support contains 4 out of 1000 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 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 72 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:05:09] [INFO ] Invariant cache hit.
[2023-03-22 06:05:10] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
[2023-03-22 06:05:10] [INFO ] Invariant cache hit.
[2023-03-22 06:05:10] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-22 06:05:10] [INFO ] Invariant cache hit.
[2023-03-22 06:05:10] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:05:10] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-22 06:05:11] [INFO ] Redundant transitions in 103 ms returned []
[2023-03-22 06:05:11] [INFO ] Invariant cache hit.
[2023-03-22 06:05:11] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2077 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s912 2), p2:(GEQ s568 3), p3:(OR (GEQ s547 2) (GEQ s872 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 85750 steps with 0 reset in 10001 ms.
Product exploration timeout after 81140 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10089 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 134174 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134174 steps, saw 133665 distinct states, run finished after 3003 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 06:05:37] [INFO ] Invariant cache hit.
[2023-03-22 06:05:37] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 06:05:37] [INFO ] After 648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 06:05:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 06:05:39] [INFO ] After 1636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 06:05:39] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:05:39] [INFO ] After 387ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 06:05:40] [INFO ] After 763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 337 ms.
[2023-03-22 06:05:40] [INFO ] After 2920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 16952 steps, including 0 resets, run visited all 2 properties in 567 ms. (steps per millisecond=29 )
Parikh walk visited 2 properties in 567 ms.
Knowledge obtained : [(AND p1 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND (NOT p1) (NOT p3)))]
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 1000 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 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 48 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:05:41] [INFO ] Invariant cache hit.
[2023-03-22 06:05:42] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
[2023-03-22 06:05:42] [INFO ] Invariant cache hit.
[2023-03-22 06:05:42] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-22 06:05:42] [INFO ] Invariant cache hit.
[2023-03-22 06:05:43] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:05:43] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2023-03-22 06:05:43] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-22 06:05:43] [INFO ] Invariant cache hit.
[2023-03-22 06:05:43] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1984 ms. Remains : 1000/1000 places, 1601/1601 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) p1 p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10125 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=106 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:05:45] [INFO ] Invariant cache hit.
[2023-03-22 06:05:46] [INFO ] [Real]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 06:05:46] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:05:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 59 ms returned sat
[2023-03-22 06:05:47] [INFO ] After 1484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:05:47] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:05:48] [INFO ] After 477ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:05:48] [INFO ] After 684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-22 06:05:48] [INFO ] After 2509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 17380 steps, including 0 resets, run visited all 1 properties in 469 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 471 ms.
Knowledge obtained : [(AND (NOT p2) p1 p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p1)))]
Knowledge based reduction with 5 factoid took 244 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Product exploration timeout after 87310 steps with 0 reset in 10001 ms.
Product exploration timeout after 82250 steps with 0 reset in 10001 ms.
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 48 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:06:09] [INFO ] Invariant cache hit.
[2023-03-22 06:06:10] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
[2023-03-22 06:06:10] [INFO ] Invariant cache hit.
[2023-03-22 06:06:10] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-22 06:06:10] [INFO ] Invariant cache hit.
[2023-03-22 06:06:10] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:06:10] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2023-03-22 06:06:11] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-22 06:06:11] [INFO ] Invariant cache hit.
[2023-03-22 06:06:11] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1984 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLFireability-01 finished in 62140 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(p0)&&X(X((F(p1)&&X(G(!p0)))))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:06:11] [INFO ] Invariant cache hit.
[2023-03-22 06:06:12] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
[2023-03-22 06:06:12] [INFO ] Invariant cache hit.
[2023-03-22 06:06:12] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-22 06:06:12] [INFO ] Invariant cache hit.
[2023-03-22 06:06:13] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:06:13] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2023-03-22 06:06:13] [INFO ] Invariant cache hit.
[2023-03-22 06:06:13] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1894 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s52 2), p1:(GEQ s626 2)], 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-02 finished in 2151 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(p0)))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:06:13] [INFO ] Invariant cache hit.
[2023-03-22 06:06:14] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
[2023-03-22 06:06:14] [INFO ] Invariant cache hit.
[2023-03-22 06:06:14] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-22 06:06:14] [INFO ] Invariant cache hit.
[2023-03-22 06:06:15] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:06:15] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-03-22 06:06:15] [INFO ] Invariant cache hit.
[2023-03-22 06:06:15] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1872 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s453 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1537 steps with 0 reset in 99 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-03 finished in 2072 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((p0||G((p1&&X(p1))))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 53 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:06:16] [INFO ] Invariant cache hit.
[2023-03-22 06:06:16] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
[2023-03-22 06:06:16] [INFO ] Invariant cache hit.
[2023-03-22 06:06:16] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-22 06:06:16] [INFO ] Invariant cache hit.
[2023-03-22 06:06:17] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:06:17] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2023-03-22 06:06:17] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-22 06:06:17] [INFO ] Invariant cache hit.
[2023-03-22 06:06:17] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1937 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LT s300 3), p0:(GEQ s622 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 87320 steps with 0 reset in 10001 ms.
Product exploration timeout after 83590 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 412 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10022 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 112391 steps, run timeout after 3005 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112391 steps, saw 111979 distinct states, run finished after 3005 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 06:06:43] [INFO ] Invariant cache hit.
[2023-03-22 06:06:43] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 06:06:44] [INFO ] After 916ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 06:06:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 06:06:46] [INFO ] After 1671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 06:06:46] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:06:47] [INFO ] After 586ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 06:06:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2023-03-22 06:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-22 06:06:47] [INFO ] After 1261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 372 ms.
[2023-03-22 06:06:48] [INFO ] After 3560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 12503 steps, including 0 resets, run visited all 4 properties in 484 ms. (steps per millisecond=25 )
Parikh walk visited 4 properties in 485 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 9 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0200-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0200-LTLFireability-04 finished in 32970 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(G(p0))))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:06:48] [INFO ] Invariant cache hit.
[2023-03-22 06:06:49] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
[2023-03-22 06:06:49] [INFO ] Invariant cache hit.
[2023-03-22 06:06:49] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-22 06:06:49] [INFO ] Invariant cache hit.
[2023-03-22 06:06:50] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:06:50] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2023-03-22 06:06:50] [INFO ] Invariant cache hit.
[2023-03-22 06:06:50] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1839 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s442 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 88020 steps with 0 reset in 10001 ms.
Product exploration timeout after 84170 steps with 0 reset in 10001 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10025 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 199131 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199131 steps, saw 198341 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:07:15] [INFO ] Invariant cache hit.
[2023-03-22 06:07:16] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 06:07:16] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:07:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 06:07:18] [INFO ] After 1455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:07:18] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:07:19] [INFO ] After 1663ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:07:20] [INFO ] After 1912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-22 06:07:20] [INFO ] After 3676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15134 steps, including 0 resets, run visited all 1 properties in 438 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 437 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:07:21] [INFO ] Invariant cache hit.
[2023-03-22 06:07:21] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
[2023-03-22 06:07:21] [INFO ] Invariant cache hit.
[2023-03-22 06:07:21] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-22 06:07:21] [INFO ] Invariant cache hit.
[2023-03-22 06:07:22] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:07:22] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-22 06:07:22] [INFO ] Invariant cache hit.
[2023-03-22 06:07:22] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1885 ms. Remains : 1000/1000 places, 1601/1601 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10173 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 197518 steps, run timeout after 3005 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197518 steps, saw 196734 distinct states, run finished after 3006 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:07:27] [INFO ] Invariant cache hit.
[2023-03-22 06:07:28] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 06:07:28] [INFO ] After 620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:07:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 06:07:30] [INFO ] After 1490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:07:30] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:07:31] [INFO ] After 1651ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:07:32] [INFO ] After 1886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-22 06:07:32] [INFO ] After 3704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 13995 steps, including 0 resets, run visited all 1 properties in 404 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 404 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 89780 steps with 0 reset in 10002 ms.
Product exploration timeout after 85470 steps with 0 reset in 10002 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 72 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:07:53] [INFO ] Invariant cache hit.
[2023-03-22 06:07:53] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
[2023-03-22 06:07:54] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-22 06:07:54] [INFO ] Invariant cache hit.
[2023-03-22 06:07:54] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1236 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:07:54] [INFO ] Invariant cache hit.
[2023-03-22 06:07:55] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
[2023-03-22 06:07:55] [INFO ] Invariant cache hit.
[2023-03-22 06:07:55] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-22 06:07:55] [INFO ] Invariant cache hit.
[2023-03-22 06:07:55] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:07:55] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2023-03-22 06:07:55] [INFO ] Invariant cache hit.
[2023-03-22 06:07:56] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1926 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLFireability-05 finished in 67640 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(p0)&&G(F(p1))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 57 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:07:56] [INFO ] Invariant cache hit.
[2023-03-22 06:07:57] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
[2023-03-22 06:07:57] [INFO ] Invariant cache hit.
[2023-03-22 06:07:57] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-22 06:07:57] [INFO ] Invariant cache hit.
[2023-03-22 06:07:57] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:07:57] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-03-22 06:07:57] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-22 06:07:57] [INFO ] Invariant cache hit.
[2023-03-22 06:07:58] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1926 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s862 1), p1:(GEQ s73 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-07 finished in 2095 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 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 37 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:07:58] [INFO ] Invariant cache hit.
[2023-03-22 06:07:59] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
[2023-03-22 06:07:59] [INFO ] Invariant cache hit.
[2023-03-22 06:07:59] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-22 06:07:59] [INFO ] Invariant cache hit.
[2023-03-22 06:08:00] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:08:00] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-22 06:08:00] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-22 06:08:00] [INFO ] Invariant cache hit.
[2023-03-22 06:08:00] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2069 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s808 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-08 finished in 2118 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' '!((p0 U X(G((p1&&F(p2)&&F(p3))))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:08:00] [INFO ] Invariant cache hit.
[2023-03-22 06:08:01] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
[2023-03-22 06:08:01] [INFO ] Invariant cache hit.
[2023-03-22 06:08:01] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-22 06:08:01] [INFO ] Invariant cache hit.
[2023-03-22 06:08:02] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:08:02] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-22 06:08:02] [INFO ] Invariant cache hit.
[2023-03-22 06:08:02] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1878 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p1) (NOT p2)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s210 5), p1:(OR (GEQ s485 5) (GEQ s517 2)), p2:(GEQ s517 2), p3:(GEQ s866 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-09 finished in 2123 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((p0||X(F(p1)))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:08:02] [INFO ] Invariant cache hit.
[2023-03-22 06:08:03] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
[2023-03-22 06:08:03] [INFO ] Invariant cache hit.
[2023-03-22 06:08:03] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-22 06:08:03] [INFO ] Invariant cache hit.
[2023-03-22 06:08:04] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:08:04] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2023-03-22 06:08:04] [INFO ] Invariant cache hit.
[2023-03-22 06:08:04] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1835 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s380 5), p1:(GEQ s275 5)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-10 finished in 1940 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 U (p1||G(p0))))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 35 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:08:04] [INFO ] Invariant cache hit.
[2023-03-22 06:08:05] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
[2023-03-22 06:08:05] [INFO ] Invariant cache hit.
[2023-03-22 06:08:05] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-22 06:08:05] [INFO ] Invariant cache hit.
[2023-03-22 06:08:06] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:08:06] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2023-03-22 06:08:06] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-22 06:08:06] [INFO ] Invariant cache hit.
[2023-03-22 06:08:06] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1981 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s804 5) (LT s945 3)), p0:(LT s945 3)], 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 39 reset in 7713 ms.
Stack based approach found an accepted trace after 2183 steps with 0 reset with depth 2184 and stack size 2184 in 162 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-11 finished in 9950 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((F(G(p0))&&F(p1)))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:08:14] [INFO ] Invariant cache hit.
[2023-03-22 06:08:15] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
[2023-03-22 06:08:15] [INFO ] Invariant cache hit.
[2023-03-22 06:08:15] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-22 06:08:15] [INFO ] Invariant cache hit.
[2023-03-22 06:08:16] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:08:16] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2023-03-22 06:08:16] [INFO ] Invariant cache hit.
[2023-03-22 06:08:16] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1905 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-12 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=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s558 3), p0:(GEQ s727 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-12 finished in 2092 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(p0) U p1))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 32 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:08:16] [INFO ] Invariant cache hit.
[2023-03-22 06:08:17] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
[2023-03-22 06:08:17] [INFO ] Invariant cache hit.
[2023-03-22 06:08:17] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-22 06:08:17] [INFO ] Invariant cache hit.
[2023-03-22 06:08:18] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:08:18] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2023-03-22 06:08:18] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 06:08:18] [INFO ] Invariant cache hit.
[2023-03-22 06:08:18] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1889 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s765 3), p0:(GEQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-13 finished in 1978 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(F(p0))))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:08:18] [INFO ] Invariant cache hit.
[2023-03-22 06:08:19] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
[2023-03-22 06:08:19] [INFO ] Invariant cache hit.
[2023-03-22 06:08:19] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-22 06:08:19] [INFO ] Invariant cache hit.
[2023-03-22 06:08:20] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:08:20] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-22 06:08:20] [INFO ] Invariant cache hit.
[2023-03-22 06:08:20] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1847 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s112 2)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-15 finished in 1967 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 U p1)||(F(p2)&&G(F(p3)))))))'
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(G(p0))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-0200-LTLFireability-05
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 38 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:08:21] [INFO ] Invariant cache hit.
[2023-03-22 06:08:21] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
[2023-03-22 06:08:21] [INFO ] Invariant cache hit.
[2023-03-22 06:08:21] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-22 06:08:21] [INFO ] Invariant cache hit.
[2023-03-22 06:08:22] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:08:22] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2023-03-22 06:08:22] [INFO ] Invariant cache hit.
[2023-03-22 06:08:22] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1863 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s442 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 88130 steps with 0 reset in 10001 ms.
Product exploration timeout after 82220 steps with 0 reset in 10001 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 194291 steps, run timeout after 3006 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194291 steps, saw 193519 distinct states, run finished after 3006 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:08:47] [INFO ] Invariant cache hit.
[2023-03-22 06:08:48] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 06:08:48] [INFO ] After 661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:08:48] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 06:08:50] [INFO ] After 1456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:08:50] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:08:51] [INFO ] After 1696ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:08:52] [INFO ] After 1948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-22 06:08:52] [INFO ] After 3726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 13620 steps, including 0 resets, run visited all 1 properties in 424 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 424 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:08:53] [INFO ] Invariant cache hit.
[2023-03-22 06:08:53] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
[2023-03-22 06:08:53] [INFO ] Invariant cache hit.
[2023-03-22 06:08:53] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-22 06:08:53] [INFO ] Invariant cache hit.
[2023-03-22 06:08:54] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:08:54] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-22 06:08:54] [INFO ] Invariant cache hit.
[2023-03-22 06:08:55] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1867 ms. Remains : 1000/1000 places, 1601/1601 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10074 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 193081 steps, run timeout after 3002 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193081 steps, saw 192314 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:09:00] [INFO ] Invariant cache hit.
[2023-03-22 06:09:00] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 06:09:00] [INFO ] After 617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:09:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 06:09:02] [INFO ] After 1529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:09:02] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:09:04] [INFO ] After 1690ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:09:04] [INFO ] After 1931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-22 06:09:04] [INFO ] After 3769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 12980 steps, including 0 resets, run visited all 1 properties in 387 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 387 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 87280 steps with 0 reset in 10002 ms.
Product exploration timeout after 81490 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 36 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:09:25] [INFO ] Invariant cache hit.
[2023-03-22 06:09:26] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
[2023-03-22 06:09:26] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 06:09:26] [INFO ] Invariant cache hit.
[2023-03-22 06:09:26] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1197 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-22 06:09:26] [INFO ] Invariant cache hit.
[2023-03-22 06:09:27] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
[2023-03-22 06:09:27] [INFO ] Invariant cache hit.
[2023-03-22 06:09:27] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-22 06:09:27] [INFO ] Invariant cache hit.
[2023-03-22 06:09:27] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 06:09:27] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2023-03-22 06:09:27] [INFO ] Invariant cache hit.
[2023-03-22 06:09:28] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1852 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLFireability-05 finished in 67691 ms.
[2023-03-22 06:09:28] [INFO ] Flatten gal took : 54 ms
[2023-03-22 06:09:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 06:09:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 1601 transitions and 4600 arcs took 11 ms.
Total runtime 306223 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1674/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1674/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : JoinFreeModules-PT-0200-LTLFireability-01
Could not compute solution for formula : JoinFreeModules-PT-0200-LTLFireability-05

BK_STOP 1679465370758

--------------------
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 JoinFreeModules-PT-0200-LTLFireability-01
ltl formula formula --ltl=/tmp/1674/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 1000 places, 1601 transitions and 4600 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.160 real 0.050 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1674/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1674/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1674/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1674/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 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 JoinFreeModules-PT-0200-LTLFireability-05
ltl formula formula --ltl=/tmp/1674/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
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 1000 places, 1601 transitions and 4600 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.160 real 0.040 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1674/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1674/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1674/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1674/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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="JoinFreeModules-PT-0200"
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 JoinFreeModules-PT-0200, 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 r233-tall-167856418500196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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