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.r361-smll-167891811700532.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 ServersAndClients-PT-400080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811700532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 7.1K Feb 26 03:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 03:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 03:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 03:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 26 03:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 03:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 03:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 20M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679356325730

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=ServersAndClients-PT-400080
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 23:52:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 23:52:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 23:52:10] [INFO ] Load time of PNML (sax parser for PT used): 1691 ms
[2023-03-20 23:52:10] [INFO ] Transformed 33681 places.
[2023-03-20 23:52:10] [INFO ] Transformed 64800 transitions.
[2023-03-20 23:52:10] [INFO ] Parsed PT model containing 33681 places and 64800 transitions and 195200 arcs in 2026 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ServersAndClients-PT-400080-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 741 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2023-03-20 23:52:14] [INFO ] Computed 881 place invariants in 2058 ms
[2023-03-20 23:52:19] [INFO ] Implicit Places using invariants in 7915 ms returned []
Implicit Place search using SMT only with invariants took 7966 ms to find 0 implicit places.
[2023-03-20 23:52:19] [INFO ] Invariant cache hit.
[2023-03-20 23:52:24] [INFO ] Dead Transitions using invariants and state equation in 4718 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13464 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Support contains 46 out of 33681 places after structural reductions.
[2023-03-20 23:52:28] [INFO ] Flatten gal took : 2616 ms
[2023-03-20 23:52:30] [INFO ] Flatten gal took : 1927 ms
[2023-03-20 23:52:34] [INFO ] Input system was already deterministic with 64800 transitions.
Support contains 45 out of 33681 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1586 ms. (steps per millisecond=6 ) properties (out of 28) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-20 23:52:38] [INFO ] Invariant cache hit.
[2023-03-20 23:53:00] [INFO ] [Real]Absence check using 481 positive place invariants in 5188 ms returned sat
[2023-03-20 23:53:01] [INFO ] [Real]Absence check using 481 positive and 400 generalized place invariants in 1273 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 23:53:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 23:53:03] [INFO ] After 25383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 33681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31509 transitions
Trivial Post-agglo rules discarded 31509 transitions
Performed 31509 trivial Post agglomeration. Transition count delta: 31509
Iterating post reduction 0 with 31509 rules applied. Total rules applied 31509 place count 33681 transition count 33291
Reduce places removed 31509 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 31588 rules applied. Total rules applied 63097 place count 2172 transition count 33212
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 27200 transitions
Reduce isomorphic transitions removed 27200 transitions.
Iterating post reduction 2 with 27348 rules applied. Total rules applied 90445 place count 2024 transition count 6012
Drop transitions removed 3988 transitions
Redundant transition composition rules discarded 3988 transitions
Iterating global reduction 3 with 3988 rules applied. Total rules applied 94433 place count 2024 transition count 2024
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 94832 place count 2024 transition count 2024
Applied a total of 94832 rules in 5554 ms. Remains 2024 /33681 variables (removed 31657) and now considering 2024/64800 (removed 62776) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5556 ms. Remains : 2024/33681 places, 2024/64800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1096 ms. (steps per millisecond=9 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2024 rows 2024 cols
[2023-03-20 23:53:10] [INFO ] Computed 812 place invariants in 51 ms
[2023-03-20 23:53:11] [INFO ] [Real]Absence check using 412 positive place invariants in 317 ms returned sat
[2023-03-20 23:53:12] [INFO ] [Real]Absence check using 412 positive and 400 generalized place invariants in 179 ms returned sat
[2023-03-20 23:53:13] [INFO ] After 1737ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2
[2023-03-20 23:53:14] [INFO ] After 2209ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-20 23:53:14] [INFO ] After 3746ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 11 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 9 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ServersAndClients-PT-400080-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(G((p0||X(p1))))'
Support contains 2 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 526 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2023-03-20 23:53:17] [INFO ] Computed 881 place invariants in 1541 ms
[2023-03-20 23:53:22] [INFO ] Implicit Places using invariants in 6255 ms returned []
Implicit Place search using SMT only with invariants took 6267 ms to find 0 implicit places.
[2023-03-20 23:53:22] [INFO ] Invariant cache hit.
[2023-03-20 23:53:27] [INFO ] Dead Transitions using invariants and state equation in 4898 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11704 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 334 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s9704 1), p1:(GEQ s20215 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 15 ms.
FORMULA ServersAndClients-PT-400080-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-LTLFireability-00 finished in 12281 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)&&X(p1)))||G(p1))) U p0))'
Support contains 2 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 359 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
[2023-03-20 23:53:27] [INFO ] Invariant cache hit.
[2023-03-20 23:53:32] [INFO ] Implicit Places using invariants in 4402 ms returned []
Implicit Place search using SMT only with invariants took 4408 ms to find 0 implicit places.
[2023-03-20 23:53:32] [INFO ] Invariant cache hit.
[2023-03-20 23:53:36] [INFO ] Dead Transitions using invariants and state equation in 4419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9196 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s14889 1), p1:(GEQ s25831 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 6 ms.
FORMULA ServersAndClients-PT-400080-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-LTLFireability-01 finished in 9531 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)))'
Support contains 2 out of 33681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31521 transitions
Trivial Post-agglo rules discarded 31521 transitions
Performed 31521 trivial Post agglomeration. Transition count delta: 31521
Iterating post reduction 0 with 31521 rules applied. Total rules applied 31521 place count 33681 transition count 33279
Reduce places removed 31521 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 31600 rules applied. Total rules applied 63121 place count 2160 transition count 33200
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 31200 transitions
Reduce isomorphic transitions removed 31200 transitions.
Iterating post reduction 2 with 31358 rules applied. Total rules applied 94479 place count 2002 transition count 2000
Applied a total of 94479 rules in 1260 ms. Remains 2002 /33681 variables (removed 31679) and now considering 2000/64800 (removed 62800) transitions.
// Phase 1: matrix 2000 rows 2002 cols
[2023-03-20 23:53:38] [INFO ] Computed 802 place invariants in 28 ms
[2023-03-20 23:53:41] [INFO ] Implicit Places using invariants in 2706 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 247, 248, 249, 250, 251, 252, 253, 254, 255, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 303, 304, 305, 306, 307, 308, 309, 310, 311, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 415, 416, 417, 418, 419, 420, 421, 422, 423, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 471, 472, 473, 474, 475, 476, 477, 478, 479, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 629, 630, 631, 632, 633, 634, 635, 636, 637, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 787, 788, 789, 790, 791, 792, 793, 794, 795, 797, 798, 799]
Discarding 783 places :
Implicit Place search using SMT only with invariants took 2717 ms to find 783 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1219/33681 places, 2000/64800 transitions.
Graph (trivial) has 1164 edges and 1219 vertex of which 765 / 1219 are part of one of the 1 SCC in 4 ms
Free SCC test removed 764 places
Ensure Unique test removed 1145 transitions
Reduce isomorphic transitions removed 1145 transitions.
Discarding 381 places :
Symmetric choice reduction at 0 with 381 rule applications. Total rules 382 place count 74 transition count 474
Iterating global reduction 0 with 381 rules applied. Total rules applied 763 place count 74 transition count 474
Ensure Unique test removed 381 transitions
Reduce isomorphic transitions removed 381 transitions.
Iterating post reduction 0 with 381 rules applied. Total rules applied 1144 place count 74 transition count 93
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 1180 place count 56 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 1181 place count 55 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 1182 place count 55 transition count 74
Applied a total of 1182 rules in 43 ms. Remains 55 /1219 variables (removed 1164) and now considering 74/2000 (removed 1926) transitions.
// Phase 1: matrix 74 rows 55 cols
[2023-03-20 23:53:41] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-20 23:53:41] [INFO ] Implicit Places using invariants in 45 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 47 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/33681 places, 74/64800 transitions.
Graph (trivial) has 35 edges and 38 vertex of which 18 / 38 are part of one of the 1 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 4 transition count 23
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 4 transition count 23
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 52 place count 4 transition count 6
Applied a total of 52 rules in 3 ms. Remains 4 /38 variables (removed 34) and now considering 6/74 (removed 68) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-20 23:53:41] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 23:53:41] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 23:53:41] [INFO ] Invariant cache hit.
[2023-03-20 23:53:41] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4/33681 places, 6/64800 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4112 ms. Remains : 4/33681 places, 6/64800 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-400080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-LTLFireability-02 finished in 4238 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((G(p0)&&(p1||F(p2))))))'
Support contains 4 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 315 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2023-03-20 23:53:43] [INFO ] Computed 881 place invariants in 1777 ms
[2023-03-20 23:53:47] [INFO ] Implicit Places using invariants in 6289 ms returned []
Implicit Place search using SMT only with invariants took 6292 ms to find 0 implicit places.
[2023-03-20 23:53:48] [INFO ] Invariant cache hit.
[2023-03-20 23:53:52] [INFO ] Dead Transitions using invariants and state equation in 4551 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11173 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s12532 1), p1:(GEQ s4918 1), p2:(AND (GEQ s1305 1) (GEQ s28869 1))], 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 timeout after 92700 steps with 0 reset in 10001 ms.
Product exploration timeout after 91960 steps with 0 reset in 10002 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) (NOT p2)), (X p0)]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
Knowledge based reduction with 2 factoid took 492 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1522 ms. (steps per millisecond=6 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 23:54:16] [INFO ] Invariant cache hit.
[2023-03-20 23:54:29] [INFO ] [Real]Absence check using 481 positive place invariants in 5927 ms returned sat
[2023-03-20 23:54:31] [INFO ] [Real]Absence check using 481 positive and 400 generalized place invariants in 1245 ms returned sat
[2023-03-20 23:54:41] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 33681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31519 transitions
Trivial Post-agglo rules discarded 31519 transitions
Performed 31519 trivial Post agglomeration. Transition count delta: 31519
Iterating post reduction 0 with 31519 rules applied. Total rules applied 31519 place count 33681 transition count 33281
Reduce places removed 31519 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 31598 rules applied. Total rules applied 63117 place count 2162 transition count 33202
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 30400 transitions
Reduce isomorphic transitions removed 30400 transitions.
Iterating post reduction 2 with 30556 rules applied. Total rules applied 93673 place count 2006 transition count 2802
Drop transitions removed 798 transitions
Redundant transition composition rules discarded 798 transitions
Iterating global reduction 3 with 798 rules applied. Total rules applied 94471 place count 2006 transition count 2004
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 94870 place count 2006 transition count 2004
Applied a total of 94870 rules in 4599 ms. Remains 2006 /33681 variables (removed 31675) and now considering 2004/64800 (removed 62796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4599 ms. Remains : 2006/33681 places, 2004/64800 transitions.
Finished random walk after 518 steps, including 0 resets, run visited all 1 properties in 43 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0)]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p1) p0 (NOT p2))))]
Knowledge based reduction with 2 factoid took 528 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-20 23:54:47] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 825 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
[2023-03-20 23:55:03] [INFO ] Invariant cache hit.
[2023-03-20 23:55:07] [INFO ] Implicit Places using invariants in 4287 ms returned []
Implicit Place search using SMT only with invariants took 4288 ms to find 0 implicit places.
[2023-03-20 23:55:07] [INFO ] Invariant cache hit.
[2023-03-20 23:55:12] [INFO ] Dead Transitions using invariants and state equation in 4359 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9484 ms. Remains : 33681/33681 places, 64800/64800 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 p0 (NOT p1) (NOT p2)), (X p0)]
False Knowledge obtained : [(X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
Knowledge based reduction with 2 factoid took 333 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1379 ms. (steps per millisecond=7 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 23:55:15] [INFO ] Invariant cache hit.
[2023-03-20 23:55:28] [INFO ] [Real]Absence check using 481 positive place invariants in 5876 ms returned sat
[2023-03-20 23:55:29] [INFO ] [Real]Absence check using 481 positive and 400 generalized place invariants in 1132 ms returned sat
[2023-03-20 23:55:40] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 33681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31519 transitions
Trivial Post-agglo rules discarded 31519 transitions
Performed 31519 trivial Post agglomeration. Transition count delta: 31519
Iterating post reduction 0 with 31519 rules applied. Total rules applied 31519 place count 33681 transition count 33281
Reduce places removed 31519 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 31598 rules applied. Total rules applied 63117 place count 2162 transition count 33202
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 30400 transitions
Reduce isomorphic transitions removed 30400 transitions.
Iterating post reduction 2 with 30556 rules applied. Total rules applied 93673 place count 2006 transition count 2802
Drop transitions removed 798 transitions
Redundant transition composition rules discarded 798 transitions
Iterating global reduction 3 with 798 rules applied. Total rules applied 94471 place count 2006 transition count 2004
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 94870 place count 2006 transition count 2004
Applied a total of 94870 rules in 4856 ms. Remains 2006 /33681 variables (removed 31675) and now considering 2004/64800 (removed 62796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4856 ms. Remains : 2006/33681 places, 2004/64800 transitions.
Finished random walk after 2097 steps, including 0 resets, run visited all 1 properties in 165 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0)]
False Knowledge obtained : [(X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p1) p0 (NOT p2))))]
Knowledge based reduction with 2 factoid took 661 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-20 23:55:46] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration timeout after 96080 steps with 0 reset in 10001 ms.
Product exploration timeout after 97360 steps with 0 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 33681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Performed 27218 Post agglomeration using F-continuation condition.
Performed 31598 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31598 rules applied. Total rules applied 31598 place count 33681 transition count 64800
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 31674 place count 33605 transition count 34400
Deduced a syphon composed of 31598 places in 8 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 31750 place count 33605 transition count 34400
Deduced a syphon composed of 31598 places in 9 ms
Applied a total of 31750 rules in 35502 ms. Remains 33605 /33681 variables (removed 76) and now considering 34400/64800 (removed 30400) transitions.
[2023-03-20 23:56:58] [INFO ] Flow matrix only has 33602 transitions (discarded 798 similar events)
// Phase 1: matrix 33602 rows 33605 cols
[2023-03-20 23:57:18] [INFO ] Computed 805 place invariants in 20052 ms
[2023-03-20 23:57:23] [INFO ] Dead Transitions using invariants and state equation in 24678 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33605/33681 places, 34400/64800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60186 ms. Remains : 33605/33681 places, 34400/64800 transitions.
Support contains 4 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 478 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2023-03-20 23:57:25] [INFO ] Computed 881 place invariants in 1384 ms
[2023-03-20 23:57:29] [INFO ] Implicit Places using invariants in 6341 ms returned []
Implicit Place search using SMT only with invariants took 6342 ms to find 0 implicit places.
[2023-03-20 23:57:29] [INFO ] Invariant cache hit.
[2023-03-20 23:57:34] [INFO ] Dead Transitions using invariants and state equation in 4371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11197 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Treatment of property ServersAndClients-PT-400080-LTLFireability-03 finished in 235951 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)) U (X((F(p1)||p2))||X(p3))))'
Support contains 6 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 835 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
[2023-03-20 23:57:38] [INFO ] Invariant cache hit.
[2023-03-20 23:57:42] [INFO ] Implicit Places using invariants in 4499 ms returned []
Implicit Place search using SMT only with invariants took 4500 ms to find 0 implicit places.
[2023-03-20 23:57:42] [INFO ] Invariant cache hit.
[2023-03-20 23:57:47] [INFO ] Dead Transitions using invariants and state equation in 4813 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10163 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (OR p3 p1 p2), p1, (OR p3 p1 p2), (OR p0 p1), (OR p1 (AND p0 p2) (AND p0 p3))]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR p3 p1 p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p3 p0 (NOT p1)) (AND p0 (NOT p1) p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(GEQ s22516 1), p3:(GEQ s12748 1), p2:(AND (GEQ s1315 1) (GEQ s30473 1)), p0:(AND (GEQ s1207 1) (GEQ s26864 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 91870 steps with 0 reset in 10001 ms.
Product exploration timeout after 95740 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), true, (X (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p3 p0 (NOT p1)) (AND p0 (NOT p1) p2)))))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p3) p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2)))), (X (OR p3 p1 p2)), (X (NOT (OR p3 p1 p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be false thanks to negative knowledge :(X (OR p3 p1 p2))
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-400080-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-400080-LTLFireability-04 finished in 31543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((!p0 U p1)) U !p1)&&X(X((X(p0) U p2)))))'
Support contains 6 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 909 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
[2023-03-20 23:58:09] [INFO ] Invariant cache hit.
[2023-03-20 23:58:14] [INFO ] Implicit Places using invariants in 4789 ms returned []
Implicit Place search using SMT only with invariants took 4791 ms to find 0 implicit places.
[2023-03-20 23:58:14] [INFO ] Invariant cache hit.
[2023-03-20 23:58:19] [INFO ] Dead Transitions using invariants and state equation in 4746 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10451 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p2) p1), (NOT p1), p1, (NOT p2), true, (NOT p1), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s865 1) (GEQ s16037 1)), p0:(AND (GEQ s919 1) (GEQ s2403 1)), p2:(AND (GEQ s1235 1) (GEQ s23656 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 7 ms.
FORMULA ServersAndClients-PT-400080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-LTLFireability-05 finished in 10926 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((G(p0)||(F(!p0)&&p1)))))'
Support contains 4 out of 33681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31044 transitions
Trivial Post-agglo rules discarded 31044 transitions
Performed 31044 trivial Post agglomeration. Transition count delta: 31044
Iterating post reduction 0 with 31044 rules applied. Total rules applied 31044 place count 33681 transition count 33756
Reduce places removed 31044 places and 0 transitions.
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Iterating post reduction 1 with 31200 rules applied. Total rules applied 62244 place count 2637 transition count 33600
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 30800 transitions
Reduce isomorphic transitions removed 30800 transitions.
Iterating post reduction 2 with 31034 rules applied. Total rules applied 93278 place count 2403 transition count 2800
Applied a total of 93278 rules in 1592 ms. Remains 2403 /33681 variables (removed 31278) and now considering 2800/64800 (removed 62000) transitions.
// Phase 1: matrix 2800 rows 2403 cols
[2023-03-20 23:58:21] [INFO ] Computed 803 place invariants in 59 ms
[2023-03-20 23:58:25] [INFO ] Implicit Places using invariants in 4061 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799]
Discarding 800 places :
Implicit Place search using SMT only with invariants took 4089 ms to find 800 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1603/33681 places, 2800/64800 transitions.
Graph (trivial) has 1196 edges and 1603 vertex of which 797 / 1603 are part of one of the 1 SCC in 1 ms
Free SCC test removed 796 places
Ensure Unique test removed 1193 transitions
Reduce isomorphic transitions removed 1193 transitions.
Discarding 795 places :
Symmetric choice reduction at 0 with 795 rule applications. Total rules 796 place count 12 transition count 812
Iterating global reduction 0 with 795 rules applied. Total rules applied 1591 place count 12 transition count 812
Ensure Unique test removed 794 transitions
Reduce isomorphic transitions removed 794 transitions.
Iterating post reduction 0 with 794 rules applied. Total rules applied 2385 place count 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2387 place count 10 transition count 16
Iterating global reduction 1 with 2 rules applied. Total rules applied 2389 place count 10 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2391 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2393 place count 7 transition count 13
Iterating global reduction 1 with 2 rules applied. Total rules applied 2395 place count 7 transition count 13
Applied a total of 2395 rules in 26 ms. Remains 7 /1603 variables (removed 1596) and now considering 13/2800 (removed 2787) transitions.
// Phase 1: matrix 13 rows 7 cols
[2023-03-20 23:58:25] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-20 23:58:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 23:58:25] [INFO ] Invariant cache hit.
[2023-03-20 23:58:25] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/33681 places, 13/64800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5775 ms. Remains : 7/33681 places, 13/64800 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s5 1)), p1:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3307 reset in 273 ms.
Stack based approach found an accepted trace after 88 steps with 1 reset with depth 75 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-400080-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400080-LTLFireability-07 finished in 6197 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))'
Support contains 3 out of 33681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31520 transitions
Trivial Post-agglo rules discarded 31520 transitions
Performed 31520 trivial Post agglomeration. Transition count delta: 31520
Iterating post reduction 0 with 31520 rules applied. Total rules applied 31520 place count 33681 transition count 33280
Reduce places removed 31520 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 31599 rules applied. Total rules applied 63119 place count 2161 transition count 33201
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 30800 transitions
Reduce isomorphic transitions removed 30800 transitions.
Iterating post reduction 2 with 30957 rules applied. Total rules applied 94076 place count 2004 transition count 2401
Drop transitions removed 399 transitions
Redundant transition composition rules discarded 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 94475 place count 2004 transition count 2002
Applied a total of 94475 rules in 1392 ms. Remains 2004 /33681 variables (removed 31677) and now considering 2002/64800 (removed 62798) transitions.
// Phase 1: matrix 2002 rows 2004 cols
[2023-03-20 23:58:27] [INFO ] Computed 803 place invariants in 27 ms
[2023-03-20 23:58:30] [INFO ] Implicit Places using invariants in 3182 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 1601]
Discarding 801 places :
Implicit Place search using SMT only with invariants took 3199 ms to find 801 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1203/33681 places, 2002/64800 transitions.
Graph (trivial) has 1198 edges and 1203 vertex of which 799 / 1203 are part of one of the 1 SCC in 1 ms
Free SCC test removed 798 places
Ensure Unique test removed 1196 transitions
Reduce isomorphic transitions removed 1196 transitions.
Discarding 398 places :
Symmetric choice reduction at 0 with 398 rule applications. Total rules 399 place count 7 transition count 408
Iterating global reduction 0 with 398 rules applied. Total rules applied 797 place count 7 transition count 408
Ensure Unique test removed 398 transitions
Reduce isomorphic transitions removed 398 transitions.
Iterating post reduction 0 with 398 rules applied. Total rules applied 1195 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1197 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 1198 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 1199 place count 5 transition count 8
Applied a total of 1199 rules in 18 ms. Remains 5 /1203 variables (removed 1198) and now considering 8/2002 (removed 1994) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-20 23:58:30] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 23:58:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 23:58:30] [INFO ] Invariant cache hit.
[2023-03-20 23:58:30] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/33681 places, 8/64800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4667 ms. Remains : 5/33681 places, 8/64800 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s2 1) (AND (GEQ s0 1) (GEQ s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-400080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-LTLFireability-11 finished in 4760 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 U (p1||G(!p0)))))'
Support contains 3 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 857 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2023-03-20 23:58:33] [INFO ] Computed 881 place invariants in 1687 ms
[2023-03-20 23:58:38] [INFO ] Implicit Places using invariants in 6519 ms returned []
Implicit Place search using SMT only with invariants took 6522 ms to find 0 implicit places.
[2023-03-20 23:58:38] [INFO ] Invariant cache hit.
[2023-03-20 23:58:42] [INFO ] Dead Transitions using invariants and state equation in 4324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11710 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (LT s22371 1)) (NOT (AND (GEQ s1595 1) (GEQ s7215 1)))), p0:(AND (GEQ s1595 1) (GEQ s7215 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 745 steps with 0 reset in 78 ms.
FORMULA ServersAndClients-PT-400080-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-LTLFireability-12 finished in 11984 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(G(p0))||(p1&&X(G(!p2)))) U p3)))'
Support contains 7 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 682 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
[2023-03-20 23:58:43] [INFO ] Invariant cache hit.
[2023-03-20 23:58:47] [INFO ] Implicit Places using invariants in 4415 ms returned []
Implicit Place search using SMT only with invariants took 4417 ms to find 0 implicit places.
[2023-03-20 23:58:47] [INFO ] Invariant cache hit.
[2023-03-20 23:58:52] [INFO ] Dead Transitions using invariants and state equation in 4816 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9921 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p3), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s1285 1) (GEQ s24057 1)), p1:(GEQ s12991 1), p0:(AND (GEQ s1297 1) (GEQ s20448 1)), p2:(AND (GEQ s981 1) (GEQ s13230 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 89950 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 8 ms.
FORMULA ServersAndClients-PT-400080-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400080-LTLFireability-13 finished in 20230 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 33681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 33681 transition count 32801
Reduce places removed 32078 places and 0 transitions.
Ensure Unique test removed 31200 transitions
Reduce isomorphic transitions removed 31200 transitions.
Iterating post reduction 1 with 63278 rules applied. Total rules applied 95277 place count 1603 transition count 1601
Drop transitions removed 399 transitions
Redundant transition composition rules discarded 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 95676 place count 1603 transition count 1202
Discarding 399 places :
Implicit places reduction removed 399 places
Drop transitions removed 798 transitions
Trivial Post-agglo rules discarded 798 transitions
Performed 798 trivial Post agglomeration. Transition count delta: 798
Iterating post reduction 2 with 1197 rules applied. Total rules applied 96873 place count 1204 transition count 404
Reduce places removed 1197 places and 0 transitions.
Ensure Unique test removed 398 transitions
Reduce isomorphic transitions removed 398 transitions.
Iterating post reduction 3 with 1595 rules applied. Total rules applied 98468 place count 7 transition count 6
Applied a total of 98468 rules in 1116 ms. Remains 7 /33681 variables (removed 33674) and now considering 6/64800 (removed 64794) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-20 23:59:04] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 23:59:04] [INFO ] Implicit Places using invariants in 24 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/33681 places, 6/64800 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 4 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-20 23:59:04] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 23:59:04] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-20 23:59:04] [INFO ] Invariant cache hit.
[2023-03-20 23:59:04] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/33681 places, 3/64800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1180 ms. Remains : 2/33681 places, 3/64800 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA ServersAndClients-PT-400080-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400080-LTLFireability-14 finished in 1312 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))'
Support contains 1 out of 33681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 33681 transition count 32801
Reduce places removed 32078 places and 0 transitions.
Ensure Unique test removed 31200 transitions
Reduce isomorphic transitions removed 31200 transitions.
Iterating post reduction 1 with 63278 rules applied. Total rules applied 95277 place count 1603 transition count 1601
Drop transitions removed 399 transitions
Redundant transition composition rules discarded 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 95676 place count 1603 transition count 1202
Discarding 399 places :
Implicit places reduction removed 399 places
Drop transitions removed 798 transitions
Trivial Post-agglo rules discarded 798 transitions
Performed 798 trivial Post agglomeration. Transition count delta: 798
Iterating post reduction 2 with 1197 rules applied. Total rules applied 96873 place count 1204 transition count 404
Reduce places removed 1197 places and 0 transitions.
Ensure Unique test removed 398 transitions
Reduce isomorphic transitions removed 398 transitions.
Iterating post reduction 3 with 1595 rules applied. Total rules applied 98468 place count 7 transition count 6
Applied a total of 98468 rules in 1153 ms. Remains 7 /33681 variables (removed 33674) and now considering 6/64800 (removed 64794) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-20 23:59:05] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 23:59:05] [INFO ] Implicit Places using invariants in 22 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/33681 places, 6/64800 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-20 23:59:05] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 23:59:05] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-20 23:59:05] [INFO ] Invariant cache hit.
[2023-03-20 23:59:05] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/33681 places, 3/64800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1216 ms. Remains : 2/33681 places, 3/64800 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-400080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-LTLFireability-15 finished in 1301 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((G(p0)&&(p1||F(p2))))))'
Found a Shortening insensitive property : ServersAndClients-PT-400080-LTLFireability-03
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31519 transitions
Trivial Post-agglo rules discarded 31519 transitions
Performed 31519 trivial Post agglomeration. Transition count delta: 31519
Iterating post reduction 0 with 31519 rules applied. Total rules applied 31519 place count 33681 transition count 33281
Reduce places removed 31519 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 31598 rules applied. Total rules applied 63117 place count 2162 transition count 33202
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 30400 transitions
Reduce isomorphic transitions removed 30400 transitions.
Iterating post reduction 2 with 30556 rules applied. Total rules applied 93673 place count 2006 transition count 2802
Drop transitions removed 798 transitions
Redundant transition composition rules discarded 798 transitions
Iterating global reduction 3 with 798 rules applied. Total rules applied 94471 place count 2006 transition count 2004
Applied a total of 94471 rules in 1556 ms. Remains 2006 /33681 variables (removed 31675) and now considering 2004/64800 (removed 62796) transitions.
// Phase 1: matrix 2004 rows 2006 cols
[2023-03-20 23:59:07] [INFO ] Computed 804 place invariants in 32 ms
[2023-03-20 23:59:11] [INFO ] Implicit Places using invariants in 3470 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 58, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 109, 110, 111, 112, 113, 114, 115, 116, 117, 119, 120, 121, 122, 123, 124, 125, 126, 127, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 211, 212, 213, 214, 215, 216, 217, 218, 219, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 267, 268, 269, 270, 271, 272, 273, 274, 275, 277, 278, 279, 280, 281, 282, 283, 284, 285, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 369, 370, 371, 372, 373, 374, 375, 376, 377, 379, 380, 381, 382, 383, 384, 385, 386, 387, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 435, 436, 437, 438, 439, 440, 441, 442, 443, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 537, 538, 539, 540, 541, 542, 543, 544, 545, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 593, 594, 595, 596, 597, 598, 599, 600, 601, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 685, 686, 687, 688, 689, 690, 691, 692, 693, 695, 696, 697, 698, 699, 700, 701, 702, 703, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 1601, 1603]
Discarding 779 places :
Implicit Place search using SMT only with invariants took 3485 ms to find 779 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1227/33681 places, 2004/64800 transitions.
Graph (trivial) has 1152 edges and 1227 vertex of which 753 / 1227 are part of one of the 1 SCC in 1 ms
Free SCC test removed 752 places
Ensure Unique test removed 1127 transitions
Reduce isomorphic transitions removed 1127 transitions.
Discarding 375 places :
Symmetric choice reduction at 0 with 375 rule applications. Total rules 376 place count 100 transition count 502
Iterating global reduction 0 with 375 rules applied. Total rules applied 751 place count 100 transition count 502
Ensure Unique test removed 375 transitions
Reduce isomorphic transitions removed 375 transitions.
Iterating post reduction 0 with 375 rules applied. Total rules applied 1126 place count 100 transition count 127
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 1 with 48 rules applied. Total rules applied 1174 place count 76 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 1175 place count 75 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 1176 place count 75 transition count 102
Applied a total of 1176 rules in 29 ms. Remains 75 /1227 variables (removed 1152) and now considering 102/2004 (removed 1902) transitions.
// Phase 1: matrix 102 rows 75 cols
[2023-03-20 23:59:11] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-20 23:59:11] [INFO ] Implicit Places using invariants in 74 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 79 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 52/33681 places, 102/64800 transitions.
Graph (trivial) has 47 edges and 52 vertex of which 24 / 52 are part of one of the 1 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 6 transition count 33
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 6 transition count 33
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 70 place count 6 transition count 10
Applied a total of 70 rules in 4 ms. Remains 6 /52 variables (removed 46) and now considering 10/102 (removed 92) transitions.
// Phase 1: matrix 10 rows 6 cols
[2023-03-20 23:59:11] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 23:59:11] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-20 23:59:11] [INFO ] Invariant cache hit.
[2023-03-20 23:59:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 6/33681 places, 10/64800 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 5201 ms. Remains : 6/33681 places, 10/64800 transitions.
Running random walk in product with property : ServersAndClients-PT-400080-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s3 1), p1:(GEQ s2 1), p2:(AND (GEQ s0 1) (GEQ s4 1))], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property ServersAndClients-PT-400080-LTLFireability-03 finished in 5712 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-20 23:59:13] [INFO ] Flatten gal took : 1981 ms
[2023-03-20 23:59:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 23:59:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33681 places, 64800 transitions and 195200 arcs took 214 ms.
Total runtime 425316 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1195/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ServersAndClients-PT-400080-LTLFireability-03

BK_STOP 1679357027367

--------------------
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 ServersAndClients-PT-400080-LTLFireability-03
ltl formula formula --ltl=/tmp/1195/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 33681 places, 64800 transitions and 195200 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 9.890 real 2.570 user 3.550 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1195/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1195/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1195/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1195/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins

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="ServersAndClients-PT-400080"
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 ServersAndClients-PT-400080, 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 r361-smll-167891811700532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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