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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.8K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K 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 304K 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-0100-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679461382964

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-0100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 05:03:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 05:03:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:03:04] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-22 05:03:04] [INFO ] Transformed 501 places.
[2023-03-22 05:03:04] [INFO ] Transformed 801 transitions.
[2023-03-22 05:03:04] [INFO ] Parsed PT model containing 501 places and 801 transitions and 2302 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 1 places and 0 transitions.
Support contains 36 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 46 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 500 cols
[2023-03-22 05:03:05] [INFO ] Computed 100 place invariants in 21 ms
[2023-03-22 05:03:05] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
[2023-03-22 05:03:05] [INFO ] Invariant cache hit.
[2023-03-22 05:03:05] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-22 05:03:05] [INFO ] Invariant cache hit.
[2023-03-22 05:03:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:05] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2023-03-22 05:03:05] [INFO ] Invariant cache hit.
[2023-03-22 05:03:06] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1478 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 36 out of 500 places after structural reductions.
[2023-03-22 05:03:06] [INFO ] Flatten gal took : 75 ms
[2023-03-22 05:03:06] [INFO ] Flatten gal took : 35 ms
[2023-03-22 05:03:06] [INFO ] Input system was already deterministic with 801 transitions.
Support contains 35 out of 500 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 34) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) 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 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) 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 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-22 05:03:06] [INFO ] Invariant cache hit.
[2023-03-22 05:03:07] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-22 05:03:07] [INFO ] After 835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-22 05:03:08] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2023-03-22 05:03:09] [INFO ] After 1339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-22 05:03:09] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:10] [INFO ] After 952ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-22 05:03:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 4 ms to minimize.
[2023-03-22 05:03:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-22 05:03:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 05:03:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-22 05:03:11] [INFO ] After 2348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 827 ms.
[2023-03-22 05:03:12] [INFO ] After 4927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Fused 21 Parikh solutions to 20 different solutions.
Finished Parikh walk after 568 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=71 )
Parikh walk visited 21 properties in 3708 ms.
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' '!(((F(p0) U p1) U X((p2 U !p0))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:16] [INFO ] Invariant cache hit.
[2023-03-22 05:03:17] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
[2023-03-22 05:03:17] [INFO ] Invariant cache hit.
[2023-03-22 05:03:17] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-22 05:03:17] [INFO ] Invariant cache hit.
[2023-03-22 05:03:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:17] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-22 05:03:17] [INFO ] Invariant cache hit.
[2023-03-22 05:03:17] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 947 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 327 ms :[p0, (AND (NOT p1) p0 (NOT p2)), p0, (NOT p1), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s318 4), p0:(GEQ s120 3), p2:(OR (GEQ s318 4) (LT s398 3))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1438 ms.
Product exploration explored 100000 steps with 50000 reset in 1447 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0100-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0100-LTLFireability-00 finished in 4645 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 p1)||X(X(F(p2)))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:21] [INFO ] Invariant cache hit.
[2023-03-22 05:03:21] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
[2023-03-22 05:03:21] [INFO ] Invariant cache hit.
[2023-03-22 05:03:21] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-22 05:03:21] [INFO ] Invariant cache hit.
[2023-03-22 05:03:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:22] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-22 05:03:22] [INFO ] Invariant cache hit.
[2023-03-22 05:03:22] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 951 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}]], initial=3, aps=[p2:(GEQ s375 3), p1:(GEQ s415 5), p0:(GEQ s286 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, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-01 finished in 1160 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((F(p0) U X(p1)))||X(p0))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:22] [INFO ] Invariant cache hit.
[2023-03-22 05:03:22] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
[2023-03-22 05:03:22] [INFO ] Invariant cache hit.
[2023-03-22 05:03:22] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-22 05:03:22] [INFO ] Invariant cache hit.
[2023-03-22 05:03:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:23] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-22 05:03:23] [INFO ] Invariant cache hit.
[2023-03-22 05:03:23] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 916 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s174 5), p1:(GEQ s7 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]]
Product exploration explored 100000 steps with 33264 reset in 1574 ms.
Product exploration explored 100000 steps with 33227 reset in 1711 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 232 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :2
Finished Best-First random walk after 1008 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=168 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 285 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:28] [INFO ] Invariant cache hit.
[2023-03-22 05:03:28] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
[2023-03-22 05:03:28] [INFO ] Invariant cache hit.
[2023-03-22 05:03:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-22 05:03:28] [INFO ] Invariant cache hit.
[2023-03-22 05:03:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:28] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-22 05:03:28] [INFO ] Invariant cache hit.
[2023-03-22 05:03:29] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 902 ms. Remains : 500/500 places, 801/801 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Finished random walk after 8210 steps, including 2 resets, run visited all 3 properties in 43 ms. (steps per millisecond=190 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 319 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 33307 reset in 1579 ms.
Product exploration explored 100000 steps with 33230 reset in 1678 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 54 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
[2023-03-22 05:03:34] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 698 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:35] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
[2023-03-22 05:03:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
[2023-03-22 05:03:35] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:35] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
[2023-03-22 05:03:35] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 929 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLFireability-02 finished in 13285 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)&&F(G(p1)))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 25 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
[2023-03-22 05:03:36] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
[2023-03-22 05:03:36] [INFO ] Invariant cache hit.
[2023-03-22 05:03:36] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-22 05:03:36] [INFO ] Invariant cache hit.
[2023-03-22 05:03:36] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:36] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-22 05:03:36] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 05:03:36] [INFO ] Invariant cache hit.
[2023-03-22 05:03:36] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1023 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s383 4) (GEQ s58 4)), p1:(GEQ s60 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-03 finished in 1166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:37] [INFO ] Invariant cache hit.
[2023-03-22 05:03:37] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
[2023-03-22 05:03:37] [INFO ] Invariant cache hit.
[2023-03-22 05:03:37] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-22 05:03:37] [INFO ] Invariant cache hit.
[2023-03-22 05:03:37] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:37] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-22 05:03:37] [INFO ] Invariant cache hit.
[2023-03-22 05:03:38] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 958 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s365 3), p1:(GEQ s94 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-0100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-04 finished in 1117 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((X((p0||F(p1)))||(p0&&(p2 U p3))))))'
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:38] [INFO ] Invariant cache hit.
[2023-03-22 05:03:38] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
[2023-03-22 05:03:38] [INFO ] Invariant cache hit.
[2023-03-22 05:03:38] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-22 05:03:38] [INFO ] Invariant cache hit.
[2023-03-22 05:03:38] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:38] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-22 05:03:38] [INFO ] Invariant cache hit.
[2023-03-22 05:03:39] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 929 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s48 4), p3:(GEQ s283 3), p2:(GEQ s17 1), p1:(GEQ s382 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24956 reset in 1660 ms.
Product exploration explored 100000 steps with 24842 reset in 1795 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 p1), (X (NOT (AND p0 (NOT p3) p2))), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 507 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=182 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 05:03:44] [INFO ] Invariant cache hit.
[2023-03-22 05:03:44] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-22 05:03:44] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:03:44] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-22 05:03:45] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:03:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:45] [INFO ] After 137ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 05:03:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:03:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-22 05:03:45] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-22 05:03:45] [INFO ] After 1354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 4845 steps, including 0 resets, run visited all 2 properties in 101 ms. (steps per millisecond=47 )
Parikh walk visited 2 properties in 101 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 p1), (X (NOT (AND p0 (NOT p3) p2))), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT p1)), (F (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND p2 p0 (NOT p3))), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 9 factoid took 687 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:47] [INFO ] Invariant cache hit.
[2023-03-22 05:03:47] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
[2023-03-22 05:03:47] [INFO ] Invariant cache hit.
[2023-03-22 05:03:47] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-22 05:03:47] [INFO ] Invariant cache hit.
[2023-03-22 05:03:47] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:47] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2023-03-22 05:03:47] [INFO ] Invariant cache hit.
[2023-03-22 05:03:48] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 907 ms. Remains : 500/500 places, 801/801 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 p2 (NOT p3) (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p3)))), (X (OR (AND (NOT p2) (NOT p3)) (NOT p0))), true, (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 480 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 05:03:49] [INFO ] Invariant cache hit.
[2023-03-22 05:03:49] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2023-03-22 05:03:49] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:03:49] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2023-03-22 05:03:50] [INFO ] After 843ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:03:50] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:50] [INFO ] After 135ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 05:03:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 05:03:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-22 05:03:50] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-22 05:03:50] [INFO ] After 1366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 4715 steps, including 0 resets, run visited all 2 properties in 85 ms. (steps per millisecond=55 )
Parikh walk visited 2 properties in 85 ms.
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p3)))), (X (OR (AND (NOT p2) (NOT p3)) (NOT p0))), true, (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT p1)), (F (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND p2 p0 (NOT p3))), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 9 factoid took 644 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 25017 reset in 1689 ms.
Product exploration explored 100000 steps with 24856 reset in 1810 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 25 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:56] [INFO ] Invariant cache hit.
[2023-03-22 05:03:56] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
[2023-03-22 05:03:56] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 05:03:56] [INFO ] Invariant cache hit.
[2023-03-22 05:03:56] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 618 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:56] [INFO ] Invariant cache hit.
[2023-03-22 05:03:57] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
[2023-03-22 05:03:57] [INFO ] Invariant cache hit.
[2023-03-22 05:03:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-22 05:03:57] [INFO ] Invariant cache hit.
[2023-03-22 05:03:57] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:57] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-22 05:03:57] [INFO ] Invariant cache hit.
[2023-03-22 05:03:57] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 895 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLFireability-05 finished in 19687 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 G(!p0)))'
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:57] [INFO ] Invariant cache hit.
[2023-03-22 05:03:58] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
[2023-03-22 05:03:58] [INFO ] Invariant cache hit.
[2023-03-22 05:03:58] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-22 05:03:58] [INFO ] Invariant cache hit.
[2023-03-22 05:03:58] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:58] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-22 05:03:58] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 05:03:58] [INFO ] Invariant cache hit.
[2023-03-22 05:03:58] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 918 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 80 ms :[p0, true, p0]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GEQ s424 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1102 steps with 0 reset in 48 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-06 finished in 1065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p1)))||p0)))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:03:58] [INFO ] Invariant cache hit.
[2023-03-22 05:03:59] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
[2023-03-22 05:03:59] [INFO ] Invariant cache hit.
[2023-03-22 05:03:59] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-22 05:03:59] [INFO ] Invariant cache hit.
[2023-03-22 05:03:59] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:03:59] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-22 05:03:59] [INFO ] Invariant cache hit.
[2023-03-22 05:03:59] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 920 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (GEQ s117 2) (GEQ s330 3)), p1:(AND (LT s330 3) (LT s117 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1174 ms.
Product exploration explored 100000 steps with 50000 reset in 1282 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 (NOT p1)), (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0100-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0100-LTLFireability-07 finished in 3782 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 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 14 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:02] [INFO ] Invariant cache hit.
[2023-03-22 05:04:02] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
[2023-03-22 05:04:02] [INFO ] Invariant cache hit.
[2023-03-22 05:04:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-22 05:04:03] [INFO ] Invariant cache hit.
[2023-03-22 05:04:03] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:03] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-22 05:04:03] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 05:04:03] [INFO ] Invariant cache hit.
[2023-03-22 05:04:03] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 913 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-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 s389 5)], 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-0100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-08 finished in 1089 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)||X(X(p1)))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:03] [INFO ] Invariant cache hit.
[2023-03-22 05:04:04] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
[2023-03-22 05:04:04] [INFO ] Invariant cache hit.
[2023-03-22 05:04:04] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-22 05:04:04] [INFO ] Invariant cache hit.
[2023-03-22 05:04:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:04] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-22 05:04:04] [INFO ] Invariant cache hit.
[2023-03-22 05:04:04] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 937 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p1:(GEQ s20 3), p0:(GEQ s445 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-09 finished in 1199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0&&F(G(p1))) U (G((p0&&F(G(p1))))||(p0&&X((G(!p2)&&F(G(p1))))))))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:05] [INFO ] Invariant cache hit.
[2023-03-22 05:04:05] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
[2023-03-22 05:04:05] [INFO ] Invariant cache hit.
[2023-03-22 05:04:05] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-22 05:04:05] [INFO ] Invariant cache hit.
[2023-03-22 05:04:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:05] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-22 05:04:05] [INFO ] Invariant cache hit.
[2023-03-22 05:04:05] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 876 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (AND (NOT p0) p2))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={1} source=1 dest: 3}], [{ cond=p1, acceptance={1} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(LT s225 3), p1:(LT s182 1), p2:(GEQ s375 3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-10 finished in 1067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(!p0 U G(p1))))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:06] [INFO ] Invariant cache hit.
[2023-03-22 05:04:06] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
[2023-03-22 05:04:06] [INFO ] Invariant cache hit.
[2023-03-22 05:04:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-22 05:04:06] [INFO ] Invariant cache hit.
[2023-03-22 05:04:06] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:06] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-22 05:04:06] [INFO ] Invariant cache hit.
[2023-03-22 05:04:06] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 915 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s150 5), p1:(LT s201 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-0100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-11 finished in 1140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F((G(!p0)||G(F(p1)))))))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:07] [INFO ] Invariant cache hit.
[2023-03-22 05:04:07] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
[2023-03-22 05:04:07] [INFO ] Invariant cache hit.
[2023-03-22 05:04:07] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-22 05:04:07] [INFO ] Invariant cache hit.
[2023-03-22 05:04:07] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:07] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-22 05:04:07] [INFO ] Invariant cache hit.
[2023-03-22 05:04:08] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 890 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 229 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, false]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GEQ s380 5), p1:(GEQ s193 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 42 reset in 3556 ms.
Stack based approach found an accepted trace after 63942 steps with 23 reset with depth 1855 and stack size 1854 in 2464 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-12 finished in 7163 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(p1)))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 20 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:14] [INFO ] Invariant cache hit.
[2023-03-22 05:04:14] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
[2023-03-22 05:04:14] [INFO ] Invariant cache hit.
[2023-03-22 05:04:14] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-22 05:04:14] [INFO ] Invariant cache hit.
[2023-03-22 05:04:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:15] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-22 05:04:15] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 05:04:15] [INFO ] Invariant cache hit.
[2023-03-22 05:04:15] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 916 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s348 3), p1:(GEQ s234 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-13 finished in 1012 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((p1&&G(p2))))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:15] [INFO ] Invariant cache hit.
[2023-03-22 05:04:15] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
[2023-03-22 05:04:15] [INFO ] Invariant cache hit.
[2023-03-22 05:04:15] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-22 05:04:15] [INFO ] Invariant cache hit.
[2023-03-22 05:04:16] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:16] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-22 05:04:16] [INFO ] Invariant cache hit.
[2023-03-22 05:04:16] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 940 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-14 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: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(GEQ s155 5), p2:(LT s485 5), p1:(GEQ s242 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-14 finished in 1141 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 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:16] [INFO ] Invariant cache hit.
[2023-03-22 05:04:16] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
[2023-03-22 05:04:16] [INFO ] Invariant cache hit.
[2023-03-22 05:04:16] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-22 05:04:16] [INFO ] Invariant cache hit.
[2023-03-22 05:04:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:17] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-22 05:04:17] [INFO ] Invariant cache hit.
[2023-03-22 05:04:17] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 924 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-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:(OR (GEQ s12 2) (GEQ s225 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]]
Product exploration explored 100000 steps with 33333 reset in 1324 ms.
Product exploration explored 100000 steps with 33333 reset in 1450 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 : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 54 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0100-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0100-LTLFireability-15 finished in 4048 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((F(p0) U X(p1)))||X(p0))))'
Found a Shortening insensitive property : JoinFreeModules-PT-0100-LTLFireability-02
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:20] [INFO ] Invariant cache hit.
[2023-03-22 05:04:21] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
[2023-03-22 05:04:21] [INFO ] Invariant cache hit.
[2023-03-22 05:04:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-22 05:04:21] [INFO ] Invariant cache hit.
[2023-03-22 05:04:21] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:21] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-22 05:04:21] [INFO ] Invariant cache hit.
[2023-03-22 05:04:21] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 899 ms. Remains : 500/500 places, 801/801 transitions.
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s174 5), p1:(GEQ s7 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33401 reset in 1376 ms.
Product exploration explored 100000 steps with 33307 reset in 1498 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 266 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10044 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=189 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:04:25] [INFO ] Invariant cache hit.
[2023-03-22 05:04:25] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-22 05:04:25] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:04:25] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-22 05:04:26] [INFO ] After 773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:04:26] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:26] [INFO ] After 200ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:04:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 05:04:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-22 05:04:26] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-22 05:04:26] [INFO ] After 1369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 5042 steps, including 0 resets, run visited all 1 properties in 67 ms. (steps per millisecond=75 )
Parikh walk visited 1 properties in 67 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 354 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:27] [INFO ] Invariant cache hit.
[2023-03-22 05:04:27] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
[2023-03-22 05:04:27] [INFO ] Invariant cache hit.
[2023-03-22 05:04:27] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-22 05:04:27] [INFO ] Invariant cache hit.
[2023-03-22 05:04:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:28] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-22 05:04:28] [INFO ] Invariant cache hit.
[2023-03-22 05:04:28] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 877 ms. Remains : 500/500 places, 801/801 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 264 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10026 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :2
Finished Best-First random walk after 1008 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=168 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 394 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 33321 reset in 1387 ms.
Product exploration explored 100000 steps with 33355 reset in 1495 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:33] [INFO ] Invariant cache hit.
[2023-03-22 05:04:33] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
[2023-03-22 05:04:33] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 05:04:33] [INFO ] Invariant cache hit.
[2023-03-22 05:04:33] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 585 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:33] [INFO ] Invariant cache hit.
[2023-03-22 05:04:33] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
[2023-03-22 05:04:34] [INFO ] Invariant cache hit.
[2023-03-22 05:04:34] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-22 05:04:34] [INFO ] Invariant cache hit.
[2023-03-22 05:04:34] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:34] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-22 05:04:34] [INFO ] Invariant cache hit.
[2023-03-22 05:04:34] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 917 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLFireability-02 finished in 14104 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((X((p0||F(p1)))||(p0&&(p2 U p3))))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-0100-LTLFireability-05
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:35] [INFO ] Invariant cache hit.
[2023-03-22 05:04:35] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
[2023-03-22 05:04:35] [INFO ] Invariant cache hit.
[2023-03-22 05:04:35] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-22 05:04:35] [INFO ] Invariant cache hit.
[2023-03-22 05:04:35] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:35] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-22 05:04:35] [INFO ] Invariant cache hit.
[2023-03-22 05:04:35] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 908 ms. Remains : 500/500 places, 801/801 transitions.
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s48 4), p3:(GEQ s283 3), p2:(GEQ s17 1), p1:(GEQ s382 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25058 reset in 1470 ms.
Product exploration explored 100000 steps with 25020 reset in 1585 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 p1), (X (NOT (AND p0 (NOT p3) p2))), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 457 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10063 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=193 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 05:04:40] [INFO ] Invariant cache hit.
[2023-03-22 05:04:40] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2023-03-22 05:04:40] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:04:40] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2023-03-22 05:04:41] [INFO ] After 823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:04:41] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:41] [INFO ] After 127ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 05:04:41] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 05:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-22 05:04:41] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-22 05:04:41] [INFO ] After 1343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 4797 steps, including 0 resets, run visited all 2 properties in 98 ms. (steps per millisecond=48 )
Parikh walk visited 2 properties in 99 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 p1), (X (NOT (AND p0 (NOT p3) p2))), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT p1)), (F (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND p2 p0 (NOT p3))), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 9 factoid took 714 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:43] [INFO ] Invariant cache hit.
[2023-03-22 05:04:43] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
[2023-03-22 05:04:43] [INFO ] Invariant cache hit.
[2023-03-22 05:04:43] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-22 05:04:43] [INFO ] Invariant cache hit.
[2023-03-22 05:04:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:43] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-22 05:04:43] [INFO ] Invariant cache hit.
[2023-03-22 05:04:44] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 935 ms. Remains : 500/500 places, 801/801 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 p2 (NOT p3) (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p3)))), (X (OR (AND (NOT p2) (NOT p3)) (NOT p0))), true, (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 507 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :7
Finished Best-First random walk after 805 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p3)))), (X (OR (AND (NOT p2) (NOT p3)) (NOT p0))), true, (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT p1)), (F (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND p2 p0 (NOT p3))), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 9 factoid took 668 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 25044 reset in 1474 ms.
Product exploration explored 100000 steps with 25070 reset in 1585 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:49] [INFO ] Invariant cache hit.
[2023-03-22 05:04:50] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
[2023-03-22 05:04:50] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 05:04:50] [INFO ] Invariant cache hit.
[2023-03-22 05:04:50] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 591 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-22 05:04:50] [INFO ] Invariant cache hit.
[2023-03-22 05:04:50] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
[2023-03-22 05:04:50] [INFO ] Invariant cache hit.
[2023-03-22 05:04:50] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-22 05:04:50] [INFO ] Invariant cache hit.
[2023-03-22 05:04:51] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 05:04:51] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-22 05:04:51] [INFO ] Invariant cache hit.
[2023-03-22 05:04:51] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 896 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLFireability-05 finished in 16719 ms.
[2023-03-22 05:04:51] [INFO ] Flatten gal took : 31 ms
[2023-03-22 05:04:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 05:04:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 500 places, 801 transitions and 2300 arcs took 6 ms.
Total runtime 107013 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2531/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2531/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : JoinFreeModules-PT-0100-LTLFireability-02
Could not compute solution for formula : JoinFreeModules-PT-0100-LTLFireability-05

BK_STOP 1679461492864

--------------------
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-0100-LTLFireability-02
ltl formula formula --ltl=/tmp/2531/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 500 places, 801 transitions and 2300 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.060 real 0.010 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2531/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2531/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2531/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2531/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name JoinFreeModules-PT-0100-LTLFireability-05
ltl formula formula --ltl=/tmp/2531/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: =============================================================================
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 500 places, 801 transitions and 2300 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.070 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2531/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2531/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2531/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2531/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0100"
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-0100, 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-167856418500188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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