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.r357-smll-167891806500500.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 itstools
Input is ServersAndClients-PT-200040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r357-smll-167891806500500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.6M
-rw-r--r-- 1 mcc users 7.6K Feb 26 03:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 03:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 26 03:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 03:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Feb 26 03:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K 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 5.1M 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-200040-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679279429588

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-200040
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-20 02:30:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 02:30:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:30:33] [INFO ] Load time of PNML (sax parser for PT used): 739 ms
[2023-03-20 02:30:33] [INFO ] Transformed 8841 places.
[2023-03-20 02:30:33] [INFO ] Transformed 16400 transitions.
[2023-03-20 02:30:33] [INFO ] Parsed PT model containing 8841 places and 16400 transitions and 49600 arcs in 940 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ServersAndClients-PT-200040-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 3453 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2023-03-20 02:30:37] [INFO ] Computed 441 place invariants in 413 ms
[2023-03-20 02:30:39] [INFO ] Implicit Places using invariants in 2318 ms returned []
Implicit Place search using SMT only with invariants took 2363 ms to find 0 implicit places.
[2023-03-20 02:30:39] [INFO ] Invariant cache hit.
[2023-03-20 02:30:40] [INFO ] Dead Transitions using invariants and state equation in 1430 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7259 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Support contains 47 out of 8841 places after structural reductions.
[2023-03-20 02:30:42] [INFO ] Flatten gal took : 1175 ms
[2023-03-20 02:30:43] [INFO ] Flatten gal took : 617 ms
[2023-03-20 02:30:44] [INFO ] Input system was already deterministic with 16400 transitions.
Support contains 46 out of 8841 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1269 ms. (steps per millisecond=7 ) properties (out of 31) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:30:46] [INFO ] Invariant cache hit.
[2023-03-20 02:30:49] [INFO ] [Real]Absence check using 241 positive place invariants in 689 ms returned sat
[2023-03-20 02:30:50] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 239 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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 02:31:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:31:11] [INFO ] After 25090ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7996 transitions
Trivial Post-agglo rules discarded 7996 transitions
Performed 7996 trivial Post agglomeration. Transition count delta: 7996
Iterating post reduction 0 with 7996 rules applied. Total rules applied 7996 place count 8841 transition count 8404
Reduce places removed 8032 places and 0 transitions.
Ensure Unique test removed 7000 transitions
Reduce isomorphic transitions removed 7000 transitions.
Iterating post reduction 1 with 15032 rules applied. Total rules applied 23028 place count 809 transition count 1404
Drop transitions removed 796 transitions
Redundant transition composition rules discarded 796 transitions
Iterating global reduction 2 with 796 rules applied. Total rules applied 23824 place count 809 transition count 608
Discarding 196 places :
Implicit places reduction removed 196 places
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 588 rules applied. Total rules applied 24412 place count 613 transition count 216
Reduce places removed 588 places and 0 transitions.
Drop transitions removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 784 rules applied. Total rules applied 25196 place count 25 transition count 20
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 25200 place count 25 transition count 20
Applied a total of 25200 rules in 454 ms. Remains 25 /8841 variables (removed 8816) and now considering 20/16400 (removed 16380) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 25/8841 places, 20/16400 transitions.
Finished random walk after 52 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=26 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 3 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 3081 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2023-03-20 02:31:16] [INFO ] Invariant cache hit.
[2023-03-20 02:31:17] [INFO ] Implicit Places using invariants in 1346 ms returned []
Implicit Place search using SMT only with invariants took 1353 ms to find 0 implicit places.
[2023-03-20 02:31:17] [INFO ] Invariant cache hit.
[2023-03-20 02:31:19] [INFO ] Dead Transitions using invariants and state equation in 1462 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5906 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 370 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s4613 1), p1:(OR (LT s769 1) (LT s8037 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 201 steps with 0 reset in 46 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-00 finished in 6491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2945 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2023-03-20 02:31:22] [INFO ] Invariant cache hit.
[2023-03-20 02:31:23] [INFO ] Implicit Places using invariants in 1390 ms returned []
Implicit Place search using SMT only with invariants took 1393 ms to find 0 implicit places.
[2023-03-20 02:31:23] [INFO ] Invariant cache hit.
[2023-03-20 02:31:25] [INFO ] Dead Transitions using invariants and state equation in 1318 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5661 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s633 1) (LT s7635 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 80260 steps with 40033 reset in 10001 ms.
Product exploration timeout after 82380 steps with 41093 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-200040-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-200040-LTLFireability-01 finished in 26201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1 U p2))))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2689 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2023-03-20 02:31:48] [INFO ] Invariant cache hit.
[2023-03-20 02:31:49] [INFO ] Implicit Places using invariants in 1377 ms returned []
Implicit Place search using SMT only with invariants took 1378 ms to find 0 implicit places.
[2023-03-20 02:31:49] [INFO ] Invariant cache hit.
[2023-03-20 02:31:51] [INFO ] Dead Transitions using invariants and state equation in 1384 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5460 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), true]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (LT s4386 1) (GEQ s633 1) (GEQ s5022 1)) (AND (GEQ s633 1) (GEQ s5022 1))), p2:(LT s7052 1), p1:(AND (GEQ s633 1) (GEQ s5022 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 238 reset in 4322 ms.
Stack based approach found an accepted trace after 9 steps with 1 reset with depth 8 and stack size 8 in 3 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-02 finished in 10006 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&&F(G(p1)))||(p2&&G(F(p3))))))'
Support contains 6 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7720 transitions
Trivial Post-agglo rules discarded 7720 transitions
Performed 7720 trivial Post agglomeration. Transition count delta: 7720
Iterating post reduction 0 with 7720 rules applied. Total rules applied 7720 place count 8841 transition count 8680
Reduce places removed 7720 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 7759 rules applied. Total rules applied 15479 place count 1121 transition count 8641
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 15518 place count 1082 transition count 8641
Applied a total of 15518 rules in 899 ms. Remains 1082 /8841 variables (removed 7759) and now considering 8641/16400 (removed 7759) transitions.
[2023-03-20 02:31:56] [INFO ] Flow matrix only has 1081 transitions (discarded 7560 similar events)
// Phase 1: matrix 1081 rows 1082 cols
[2023-03-20 02:31:56] [INFO ] Computed 441 place invariants in 31 ms
[2023-03-20 02:32:00] [INFO ] Implicit Places using invariants in 3609 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, 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]
Discarding 399 places :
Implicit Place search using SMT only with invariants took 3623 ms to find 399 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 683/8841 places, 8641/16400 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 198 place count 485 transition count 8443
Iterating global reduction 0 with 198 rules applied. Total rules applied 396 place count 485 transition count 8443
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 594 place count 287 transition count 8245
Iterating global reduction 0 with 198 rules applied. Total rules applied 792 place count 287 transition count 8245
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 987 place count 92 transition count 445
Iterating global reduction 0 with 195 rules applied. Total rules applied 1182 place count 92 transition count 445
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 0 with 195 rules applied. Total rules applied 1377 place count 92 transition count 250
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 1379 place count 91 transition count 249
Applied a total of 1379 rules in 621 ms. Remains 91 /683 variables (removed 592) and now considering 249/8641 (removed 8392) transitions.
[2023-03-20 02:32:00] [INFO ] Flow matrix only has 99 transitions (discarded 150 similar events)
// Phase 1: matrix 99 rows 91 cols
[2023-03-20 02:32:00] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-20 02:32:01] [INFO ] Implicit Places using invariants in 181 ms returned [8, 10, 12, 14, 16, 18, 23, 25, 27, 30, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89]
Discarding 39 places :
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Implicit Place search using SMT only with invariants took 185 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/8841 places, 99/16400 transitions.
Graph (trivial) has 45 edges and 52 vertex of which 4 / 52 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 39 place count 11 transition count 54
Iterating global reduction 0 with 38 rules applied. Total rules applied 77 place count 11 transition count 54
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 115 place count 11 transition count 16
Applied a total of 115 rules in 9 ms. Remains 11 /52 variables (removed 41) and now considering 16/99 (removed 83) transitions.
// Phase 1: matrix 16 rows 11 cols
[2023-03-20 02:32:01] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-20 02:32:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-20 02:32:01] [INFO ] Invariant cache hit.
[2023-03-20 02:32:01] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 11/8841 places, 16/16400 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5394 ms. Remains : 11/8841 places, 16/16400 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s10 1), p2:(OR (LT s0 1) (LT s2 1)), p3:(OR (LT s3 1) (LT s6 1)), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2265 steps with 83 reset in 20 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-03 finished in 5688 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 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8841 transition count 8401
Reduce places removed 8038 places and 0 transitions.
Ensure Unique test removed 7600 transitions
Reduce isomorphic transitions removed 7600 transitions.
Iterating post reduction 1 with 15638 rules applied. Total rules applied 23637 place count 803 transition count 801
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 2 with 199 rules applied. Total rules applied 23836 place count 803 transition count 602
Discarding 199 places :
Implicit places reduction removed 199 places
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 2 with 597 rules applied. Total rules applied 24433 place count 604 transition count 204
Reduce places removed 597 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 795 rules applied. Total rules applied 25228 place count 7 transition count 6
Applied a total of 25228 rules in 192 ms. Remains 7 /8841 variables (removed 8834) and now considering 6/16400 (removed 16394) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-20 02:32:01] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 02:32:01] [INFO ] Implicit Places using invariants in 23 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/8841 places, 6/16400 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 1 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 02:32:01] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-20 02:32:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-20 02:32:01] [INFO ] Invariant cache hit.
[2023-03-20 02:32:01] [INFO ] Implicit Places using invariants and state equation in 18 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 2 : 2/8841 places, 3/16400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 2/8841 places, 3/16400 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-04 finished in 326 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(F(((p0 U p1)&&F(p0)))))) U (p2 U p3)))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 3266 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2023-03-20 02:32:05] [INFO ] Computed 441 place invariants in 153 ms
[2023-03-20 02:32:06] [INFO ] Implicit Places using invariants in 1517 ms returned []
Implicit Place search using SMT only with invariants took 1518 ms to find 0 implicit places.
[2023-03-20 02:32:06] [INFO ] Invariant cache hit.
[2023-03-20 02:32:07] [INFO ] Dead Transitions using invariants and state equation in 1145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5938 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 472 ms :[(NOT p3), (AND p0 p1), (AND p0 p1 (NOT p3)), (AND p0 p1), true, (AND p1 (NOT p0)), p0, (AND p0 p1 (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=10 dest: 8}]], initial=0, aps=[p3:(GEQ s4568 1), p2:(GEQ s7084 1), p1:(GEQ s4485 1), p0:(GEQ s5672 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, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 4167 ms.
Product exploration explored 100000 steps with 1 reset in 3938 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 p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), true, (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))))]
Knowledge based reduction with 10 factoid took 1334 ms. Reduced automaton from 11 states, 28 edges and 4 AP (stutter sensitive) to 11 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(NOT p3), (AND p0 p1), (AND p0 p1 (NOT p3)), (AND p0 p1), true, (AND p1 (NOT p0)), p0, (AND p0 p1 (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 998 ms. (steps per millisecond=10 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-20 02:32:19] [INFO ] Invariant cache hit.
[2023-03-20 02:32:23] [INFO ] [Real]Absence check using 241 positive place invariants in 563 ms returned sat
[2023-03-20 02:32:23] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 241 ms returned sat
[2023-03-20 02:32:44] [INFO ] After 20728ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:4
[2023-03-20 02:33:20] [INFO ] Deduced a trap composed of 2 places in 35264 ms of which 14 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 02:33:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:33:20] [INFO ] After 60316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 32 ms.
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7996 transitions
Trivial Post-agglo rules discarded 7996 transitions
Performed 7996 trivial Post agglomeration. Transition count delta: 7996
Iterating post reduction 0 with 7996 rules applied. Total rules applied 7996 place count 8841 transition count 8404
Reduce places removed 8033 places and 0 transitions.
Ensure Unique test removed 7200 transitions
Reduce isomorphic transitions removed 7200 transitions.
Iterating post reduction 1 with 15233 rules applied. Total rules applied 23229 place count 808 transition count 1204
Drop transitions removed 596 transitions
Redundant transition composition rules discarded 596 transitions
Iterating global reduction 2 with 596 rules applied. Total rules applied 23825 place count 808 transition count 608
Discarding 196 places :
Implicit places reduction removed 196 places
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 588 rules applied. Total rules applied 24413 place count 612 transition count 216
Reduce places removed 588 places and 0 transitions.
Drop transitions removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 784 rules applied. Total rules applied 25197 place count 24 transition count 20
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 25201 place count 24 transition count 20
Applied a total of 25201 rules in 262 ms. Remains 24 /8841 variables (removed 8817) and now considering 20/16400 (removed 16380) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 24/8841 places, 20/16400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Probably explored full state space saw : 13 states, properties seen :0
Probabilistic random walk after 33 steps, saw 13 distinct states, run finished after 10 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 13 states, properties seen :0
Exhaustive walk after 33 steps, saw 13 distinct states, run finished after 2 ms. (steps per millisecond=16 ) properties seen :0
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), true, (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND (NOT p3) (NOT p2) p0 p1))), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p3) p2 p0 (NOT p1)))), (G (NOT (AND (NOT p3) p2 (NOT p0) p1))), (G (NOT (AND (NOT p3) p2 p0 p1)))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (F p0), (F (AND (NOT p3) (NOT p2) p0 (NOT p1))), (F (AND (NOT p3) p2 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (F p1), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F p3), (F (AND (NOT p3) p2)), (F (NOT (AND (NOT p3) (NOT p2)))), (F (AND (NOT p3) (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 15 factoid took 2489 ms. Reduced automaton from 11 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 547 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (AND (NOT p3) (NOT p2) p1 p0), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (OR (NOT p1) (NOT p2) p3), (OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND p0 (NOT p2)) (AND p0 p3)), (AND p1 (NOT p3) (NOT p2) p0)]
Stuttering acceptance computed with spot in 494 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (AND (NOT p3) (NOT p2) p1 p0), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (OR (NOT p1) (NOT p2) p3), (OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND p0 (NOT p2)) (AND p0 p3)), (AND p1 (NOT p3) (NOT p2) p0)]
[2023-03-20 02:33:24] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p3))
[2023-03-20 02:33:39] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2987 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2023-03-20 02:33:57] [INFO ] Invariant cache hit.
[2023-03-20 02:33:58] [INFO ] Implicit Places using invariants in 1189 ms returned []
Implicit Place search using SMT only with invariants took 1189 ms to find 0 implicit places.
[2023-03-20 02:33:58] [INFO ] Invariant cache hit.
[2023-03-20 02:33:59] [INFO ] Dead Transitions using invariants and state equation in 1236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5416 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (OR (NOT p1) (NOT p2) p3)), (X (X (OR (NOT p1) (NOT p2) p3)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X p1)), (X (X (OR (AND p0 (NOT p2)) (AND p0 p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND p1 p3)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
Knowledge based reduction with 6 factoid took 1163 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (AND (NOT p3) (NOT p2) p1 p0), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (OR (NOT p1) (NOT p2) p3), (OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND p0 (NOT p2)) (AND p0 p3)), (AND p1 (NOT p3) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 959 ms. (steps per millisecond=10 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 02:34:02] [INFO ] Invariant cache hit.
[2023-03-20 02:34:05] [INFO ] [Real]Absence check using 241 positive place invariants in 789 ms returned sat
[2023-03-20 02:34:06] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 313 ms returned sat
[2023-03-20 02:34:22] [INFO ] After 16174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-20 02:34:24] [INFO ] After 17605ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 906 ms.
[2023-03-20 02:34:25] [INFO ] After 22109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-20 02:34:28] [INFO ] [Nat]Absence check using 241 positive place invariants in 849 ms returned sat
[2023-03-20 02:34:28] [INFO ] [Nat]Absence check using 241 positive and 200 generalized place invariants in 240 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 02:34:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:34:50] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1 real:4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7996 transitions
Trivial Post-agglo rules discarded 7996 transitions
Performed 7996 trivial Post agglomeration. Transition count delta: 7996
Iterating post reduction 0 with 7996 rules applied. Total rules applied 7996 place count 8841 transition count 8404
Reduce places removed 8033 places and 0 transitions.
Ensure Unique test removed 7200 transitions
Reduce isomorphic transitions removed 7200 transitions.
Iterating post reduction 1 with 15233 rules applied. Total rules applied 23229 place count 808 transition count 1204
Drop transitions removed 596 transitions
Redundant transition composition rules discarded 596 transitions
Iterating global reduction 2 with 596 rules applied. Total rules applied 23825 place count 808 transition count 608
Discarding 196 places :
Implicit places reduction removed 196 places
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 588 rules applied. Total rules applied 24413 place count 612 transition count 216
Reduce places removed 588 places and 0 transitions.
Drop transitions removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 784 rules applied. Total rules applied 25197 place count 24 transition count 20
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 25201 place count 24 transition count 20
Applied a total of 25201 rules in 264 ms. Remains 24 /8841 variables (removed 8817) and now considering 20/16400 (removed 16380) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 24/8841 places, 20/16400 transitions.
Finished random walk after 26 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=26 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (OR (NOT p1) (NOT p2) p3)), (X (X (OR (NOT p1) (NOT p2) p3))), (G (OR (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X p1)), (X (X (OR (AND p0 (NOT p2)) (AND p0 p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND p1 p3)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (F p1), (F (OR (AND p1 (NOT p2)) (AND p1 p3))), (F (OR (AND (NOT p2) p0) (AND p3 p0))), (F (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (F (AND (NOT p1) p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND (NOT p2) (NOT p3) p0)), (F (NOT (OR (AND p2 (NOT p3)) (NOT p0)))), (F (AND p1 (NOT p2) (NOT p3)))]
Knowledge based reduction with 7 factoid took 1546 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(NOT p3), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (AND (NOT p3) (NOT p2) p1 p0), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), true, p1, (OR (AND p0 (NOT p2)) (AND p0 p3)), (AND p1 (NOT p3) p0 (NOT p2))]
Stuttering acceptance computed with spot in 343 ms :[(NOT p3), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (AND (NOT p3) (NOT p2) p1 p0), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), true, p1, (OR (AND p0 (NOT p2)) (AND p0 p3)), (AND p1 (NOT p3) p0 (NOT p2))]
[2023-03-20 02:34:52] [INFO ] Invariant cache hit.
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 359 ms :[(NOT p3), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), (AND (NOT p3) (NOT p2) p1 p0), (OR (AND p0 p1 (NOT p2)) (AND p0 p1 p3)), true, p1, (OR (AND p0 (NOT p2)) (AND p0 p3)), (AND p1 (NOT p3) p0 (NOT p2))]
Entered a terminal (fully accepting) state of product in 75446 steps with 0 reset in 3287 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-05 finished in 189689 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((X(p1)||p0)))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2894 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2023-03-20 02:35:14] [INFO ] Invariant cache hit.
[2023-03-20 02:35:15] [INFO ] Implicit Places using invariants in 1280 ms returned []
Implicit Place search using SMT only with invariants took 1281 ms to find 0 implicit places.
[2023-03-20 02:35:15] [INFO ] Invariant cache hit.
[2023-03-20 02:35:16] [INFO ] Dead Transitions using invariants and state equation in 1362 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5544 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-06 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:(OR (LT s6552 1) (AND (GEQ s435 1) (GEQ s7635 1))), p1:(GEQ s8458 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 61635 steps with 0 reset in 2547 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-06 finished in 8259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 3162 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2023-03-20 02:35:22] [INFO ] Invariant cache hit.
[2023-03-20 02:35:24] [INFO ] Implicit Places using invariants in 1608 ms returned []
Implicit Place search using SMT only with invariants took 1616 ms to find 0 implicit places.
[2023-03-20 02:35:24] [INFO ] Invariant cache hit.
[2023-03-20 02:35:25] [INFO ] Dead Transitions using invariants and state equation in 1441 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6225 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s697 1) (GEQ s7836 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-07 finished in 6401 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&&X(X(p1))) U p2)||X(p2)))||G(p0))))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 3275 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2023-03-20 02:35:29] [INFO ] Invariant cache hit.
[2023-03-20 02:35:30] [INFO ] Implicit Places using invariants in 1265 ms returned []
Implicit Place search using SMT only with invariants took 1267 ms to find 0 implicit places.
[2023-03-20 02:35:30] [INFO ] Invariant cache hit.
[2023-03-20 02:35:31] [INFO ] Dead Transitions using invariants and state equation in 1317 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5867 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={1} source=4 dest: 3}]], initial=0, aps=[p0:(GEQ s8477 1), p2:(AND (GEQ s483 1) (GEQ s1404 1)), p1:(GEQ s6028 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 65 reset in 4161 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 2 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-08 finished in 10337 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((F(G(p1))&&p0)))'
Support contains 5 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7326 transitions
Trivial Post-agglo rules discarded 7326 transitions
Performed 7326 trivial Post agglomeration. Transition count delta: 7326
Iterating post reduction 0 with 7326 rules applied. Total rules applied 7326 place count 8841 transition count 9074
Reduce places removed 7326 places and 0 transitions.
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Iterating post reduction 1 with 7400 rules applied. Total rules applied 14726 place count 1515 transition count 9000
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 7200 transitions
Reduce isomorphic transitions removed 7200 transitions.
Iterating post reduction 2 with 7311 rules applied. Total rules applied 22037 place count 1404 transition count 1800
Applied a total of 22037 rules in 241 ms. Remains 1404 /8841 variables (removed 7437) and now considering 1800/16400 (removed 14600) transitions.
// Phase 1: matrix 1800 rows 1404 cols
[2023-03-20 02:35:36] [INFO ] Computed 404 place invariants in 16 ms
[2023-03-20 02:35:38] [INFO ] Implicit Places using invariants in 1654 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]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 1658 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/8841 places, 1800/16400 transitions.
Graph (trivial) has 596 edges and 1004 vertex of which 397 / 1004 are part of one of the 1 SCC in 1 ms
Free SCC test removed 396 places
Ensure Unique test removed 593 transitions
Reduce isomorphic transitions removed 593 transitions.
Discarding 592 places :
Symmetric choice reduction at 0 with 592 rule applications. Total rules 593 place count 16 transition count 615
Iterating global reduction 0 with 592 rules applied. Total rules applied 1185 place count 16 transition count 615
Ensure Unique test removed 591 transitions
Reduce isomorphic transitions removed 591 transitions.
Iterating post reduction 0 with 591 rules applied. Total rules applied 1776 place count 16 transition count 24
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1779 place count 13 transition count 21
Iterating global reduction 1 with 3 rules applied. Total rules applied 1782 place count 13 transition count 21
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 1784 place count 12 transition count 20
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1787 place count 9 transition count 17
Iterating global reduction 1 with 3 rules applied. Total rules applied 1790 place count 9 transition count 17
Applied a total of 1790 rules in 13 ms. Remains 9 /1004 variables (removed 995) and now considering 17/1800 (removed 1783) transitions.
// Phase 1: matrix 17 rows 9 cols
[2023-03-20 02:35:38] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 02:35:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-20 02:35:38] [INFO ] Invariant cache hit.
[2023-03-20 02:35:38] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/8841 places, 17/16400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1956 ms. Remains : 9/8841 places, 17/16400 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s5 1) (OR (LT s1 1) (LT s3 1))), p1:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-09 finished in 2093 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)||F(p1)))'
Support contains 6 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7289 transitions
Trivial Post-agglo rules discarded 7289 transitions
Performed 7289 trivial Post agglomeration. Transition count delta: 7289
Iterating post reduction 0 with 7289 rules applied. Total rules applied 7289 place count 8841 transition count 9111
Reduce places removed 7289 places and 0 transitions.
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Iterating post reduction 1 with 7400 rules applied. Total rules applied 14689 place count 1552 transition count 9000
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 7200 transitions
Reduce isomorphic transitions removed 7200 transitions.
Iterating post reduction 2 with 7348 rules applied. Total rules applied 22037 place count 1404 transition count 1800
Applied a total of 22037 rules in 219 ms. Remains 1404 /8841 variables (removed 7437) and now considering 1800/16400 (removed 14600) transitions.
// Phase 1: matrix 1800 rows 1404 cols
[2023-03-20 02:35:38] [INFO ] Computed 404 place invariants in 16 ms
[2023-03-20 02:35:40] [INFO ] Implicit Places using invariants in 1609 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]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 1613 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/8841 places, 1800/16400 transitions.
Graph (trivial) has 594 edges and 1004 vertex of which 395 / 1004 are part of one of the 1 SCC in 0 ms
Free SCC test removed 394 places
Ensure Unique test removed 590 transitions
Reduce isomorphic transitions removed 590 transitions.
Discarding 590 places :
Symmetric choice reduction at 0 with 590 rule applications. Total rules 591 place count 20 transition count 620
Iterating global reduction 0 with 590 rules applied. Total rules applied 1181 place count 20 transition count 620
Ensure Unique test removed 588 transitions
Reduce isomorphic transitions removed 588 transitions.
Iterating post reduction 0 with 588 rules applied. Total rules applied 1769 place count 20 transition count 32
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1775 place count 14 transition count 26
Iterating global reduction 1 with 6 rules applied. Total rules applied 1781 place count 14 transition count 26
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 1783 place count 13 transition count 25
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1786 place count 10 transition count 22
Iterating global reduction 1 with 3 rules applied. Total rules applied 1789 place count 10 transition count 22
Applied a total of 1789 rules in 16 ms. Remains 10 /1004 variables (removed 994) and now considering 22/1800 (removed 1778) transitions.
// Phase 1: matrix 22 rows 10 cols
[2023-03-20 02:35:40] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 02:35:40] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-20 02:35:40] [INFO ] Invariant cache hit.
[2023-03-20 02:35:40] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/8841 places, 22/16400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1896 ms. Remains : 10/8841 places, 22/16400 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s2 1) (GEQ s8 1)), p0:(AND (OR (LT s1 1) (LT s6 1)) (OR (LT s0 1) (LT s4 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-11 finished in 1993 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(p1)||p0)))'
Support contains 6 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7486 transitions
Trivial Post-agglo rules discarded 7486 transitions
Performed 7486 trivial Post agglomeration. Transition count delta: 7486
Iterating post reduction 0 with 7486 rules applied. Total rules applied 7486 place count 8841 transition count 8914
Reduce places removed 7486 places and 0 transitions.
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Iterating post reduction 1 with 7562 rules applied. Total rules applied 15048 place count 1355 transition count 8838
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 15124 place count 1279 transition count 8838
Applied a total of 15124 rules in 426 ms. Remains 1279 /8841 variables (removed 7562) and now considering 8838/16400 (removed 7562) transitions.
[2023-03-20 02:35:40] [INFO ] Flow matrix only has 1475 transitions (discarded 7363 similar events)
// Phase 1: matrix 1475 rows 1279 cols
[2023-03-20 02:35:40] [INFO ] Computed 441 place invariants in 18 ms
[2023-03-20 02:35:44] [INFO ] Implicit Places using invariants in 3373 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, 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]
Discarding 399 places :
Implicit Place search using SMT only with invariants took 3379 ms to find 399 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 880/8841 places, 8838/16400 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 198 place count 682 transition count 8640
Iterating global reduction 0 with 198 rules applied. Total rules applied 396 place count 682 transition count 8640
Discarding 396 places :
Symmetric choice reduction at 0 with 396 rule applications. Total rules 792 place count 286 transition count 8244
Iterating global reduction 0 with 396 rules applied. Total rules applied 1188 place count 286 transition count 8244
Discarding 196 places :
Symmetric choice reduction at 0 with 196 rule applications. Total rules 1384 place count 90 transition count 404
Iterating global reduction 0 with 196 rules applied. Total rules applied 1580 place count 90 transition count 404
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 1776 place count 90 transition count 208
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 1778 place count 89 transition count 207
Applied a total of 1778 rules in 506 ms. Remains 89 /880 variables (removed 791) and now considering 207/8838 (removed 8631) transitions.
[2023-03-20 02:35:44] [INFO ] Flow matrix only has 96 transitions (discarded 111 similar events)
// Phase 1: matrix 96 rows 89 cols
[2023-03-20 02:35:44] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-20 02:35:44] [INFO ] Implicit Places using invariants in 161 ms returned [7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 87]
Discarding 38 places :
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Implicit Place search using SMT only with invariants took 166 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/8841 places, 96/16400 transitions.
Graph (trivial) has 40 edges and 51 vertex of which 2 / 51 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 13 transition count 58
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 13 transition count 58
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 112 place count 13 transition count 21
Applied a total of 112 rules in 3 ms. Remains 13 /51 variables (removed 38) and now considering 21/96 (removed 75) transitions.
// Phase 1: matrix 21 rows 13 cols
[2023-03-20 02:35:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 02:35:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 02:35:45] [INFO ] Invariant cache hit.
[2023-03-20 02:35:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 13/8841 places, 21/16400 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4531 ms. Remains : 13/8841 places, 21/16400 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s7 1)), p1:(OR (AND (GEQ s4 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s3 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 8 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-12 finished in 4630 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 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7761 transitions
Trivial Post-agglo rules discarded 7761 transitions
Performed 7761 trivial Post agglomeration. Transition count delta: 7761
Iterating post reduction 0 with 7761 rules applied. Total rules applied 7761 place count 8841 transition count 8639
Reduce places removed 7761 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 7800 rules applied. Total rules applied 15561 place count 1080 transition count 8600
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 7600 transitions
Reduce isomorphic transitions removed 7600 transitions.
Iterating post reduction 2 with 7678 rules applied. Total rules applied 23239 place count 1002 transition count 1000
Applied a total of 23239 rules in 149 ms. Remains 1002 /8841 variables (removed 7839) and now considering 1000/16400 (removed 15400) transitions.
// Phase 1: matrix 1000 rows 1002 cols
[2023-03-20 02:35:45] [INFO ] Computed 402 place invariants in 9 ms
[2023-03-20 02:35:46] [INFO ] Implicit Places using invariants in 1302 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]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 1306 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 602/8841 places, 1000/16400 transitions.
Graph (trivial) has 598 edges and 602 vertex of which 399 / 602 are part of one of the 1 SCC in 1 ms
Free SCC test removed 398 places
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 6 transition count 206
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 6 transition count 206
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 595 place count 6 transition count 8
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 597 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 598 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 599 place count 4 transition count 6
Applied a total of 599 rules in 8 ms. Remains 4 /602 variables (removed 598) and now considering 6/1000 (removed 994) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-20 02:35:46] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-20 02:35:46] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 02:35:46] [INFO ] Invariant cache hit.
[2023-03-20 02:35:46] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/8841 places, 6/16400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1504 ms. Remains : 4/8841 places, 6/16400 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-14 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-200040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-14 finished in 1592 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||(p0 U X(p1)))&&((p0 U X(p1))||F(p2))))))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2318 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2023-03-20 02:35:49] [INFO ] Computed 441 place invariants in 226 ms
[2023-03-20 02:35:50] [INFO ] Implicit Places using invariants in 1447 ms returned []
Implicit Place search using SMT only with invariants took 1460 ms to find 0 implicit places.
[2023-03-20 02:35:50] [INFO ] Invariant cache hit.
[2023-03-20 02:35:51] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5163 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s557 1) (GEQ s6630 1)), p2:(GEQ s1867 1), p1:(GEQ s4528 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 explored 100000 steps with 4 reset in 3808 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-15 finished in 9258 ms.
All properties solved by simple procedures.
Total runtime 323688 ms.

BK_STOP 1679279756924

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ServersAndClients-PT-200040, 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 r357-smll-167891806500500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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