About the Execution of ITS-Tools for ServersAndClients-PT-400160
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15405.428 | 3600000.00 | 4824813.00 | 10327.00 | FFFFT?FTTFFFFFFF | normal |
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-167891806600540.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-400160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r357-smll-167891806600540
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 7.2K Feb 26 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 03:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 03:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 04:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 04:10 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 41M 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-400160-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-400160-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679309891801
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-400160
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-20 10:58:15] [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 10:58:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:58:18] [INFO ] Load time of PNML (sax parser for PT used): 2652 ms
[2023-03-20 10:58:18] [INFO ] Transformed 65761 places.
[2023-03-20 10:58:18] [INFO ] Transformed 128800 transitions.
[2023-03-20 10:58:18] [INFO ] Parsed PT model containing 65761 places and 128800 transitions and 387200 arcs in 3194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ServersAndClients-PT-400160-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400160-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400160-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400160-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400160-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 2736 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
// Phase 1: matrix 128800 rows 65761 cols
[2023-03-20 10:58:26] [INFO ] Computed 961 place invariants in 4097 ms
[2023-03-20 10:58:36] [INFO ] Implicit Places using invariants in 14187 ms returned []
Implicit Place search using SMT only with invariants took 14232 ms to find 0 implicit places.
[2023-03-20 10:58:36] [INFO ] Invariant cache hit.
[2023-03-20 10:58:45] [INFO ] Dead Transitions using invariants and state equation in 9781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26768 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Support contains 31 out of 65761 places after structural reductions.
[2023-03-20 10:58:51] [INFO ] Flatten gal took : 4257 ms
[2023-03-20 10:58:55] [INFO ] Flatten gal took : 3778 ms
[2023-03-20 10:59:02] [INFO ] Input system was already deterministic with 128800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1994 ms. (steps per millisecond=5 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
[2023-03-20 10:59:06] [INFO ] Invariant cache hit.
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.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
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 10:59:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 10:59:31] [INFO ] After 25078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 65761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Drop transitions removed 63993 transitions
Trivial Post-agglo rules discarded 63993 transitions
Performed 63993 trivial Post agglomeration. Transition count delta: 63993
Iterating post reduction 0 with 63993 rules applied. Total rules applied 63993 place count 65761 transition count 64807
Reduce places removed 64146 places and 0 transitions.
Ensure Unique test removed 60800 transitions
Reduce isomorphic transitions removed 60800 transitions.
Iterating post reduction 1 with 124946 rules applied. Total rules applied 188939 place count 1615 transition count 4007
Drop transitions removed 2793 transitions
Redundant transition composition rules discarded 2793 transitions
Iterating global reduction 2 with 2793 rules applied. Total rules applied 191732 place count 1615 transition count 1214
Discarding 393 places :
Implicit places reduction removed 393 places
Drop transitions removed 786 transitions
Trivial Post-agglo rules discarded 786 transitions
Performed 786 trivial Post agglomeration. Transition count delta: 786
Iterating post reduction 2 with 1179 rules applied. Total rules applied 192911 place count 1222 transition count 428
Reduce places removed 1179 places and 0 transitions.
Drop transitions removed 393 transitions
Reduce isomorphic transitions removed 393 transitions.
Iterating post reduction 3 with 1572 rules applied. Total rules applied 194483 place count 43 transition count 35
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 194490 place count 43 transition count 35
Applied a total of 194490 rules in 4392 ms. Remains 43 /65761 variables (removed 65718) and now considering 35/128800 (removed 128765) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4392 ms. Remains : 43/65761 places, 35/128800 transitions.
Finished random walk after 88 steps, including 0 resets, run visited all 7 properties in 5 ms. (steps per millisecond=17 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0||G(p1))))))))'
Support contains 4 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 2153 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
[2023-03-20 10:59:38] [INFO ] Invariant cache hit.
[2023-03-20 10:59:48] [INFO ] Implicit Places using invariants in 9598 ms returned []
Implicit Place search using SMT only with invariants took 9604 ms to find 0 implicit places.
[2023-03-20 10:59:48] [INFO ] Invariant cache hit.
[2023-03-20 10:59:57] [INFO ] Dead Transitions using invariants and state equation in 9133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20898 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Stuttering acceptance computed with spot in 468 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s1059 1) (GEQ s15235 1)), p0:(AND (GEQ s1145 1) (GEQ s6012 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 71290 steps with 39 reset in 10001 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 10 ms.
FORMULA ServersAndClients-PT-400160-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400160-LTLFireability-00 finished in 31894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1268 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
[2023-03-20 11:00:09] [INFO ] Invariant cache hit.
[2023-03-20 11:00:18] [INFO ] Implicit Places using invariants in 8547 ms returned []
Implicit Place search using SMT only with invariants took 8549 ms to find 0 implicit places.
[2023-03-20 11:00:18] [INFO ] Invariant cache hit.
[2023-03-20 11:00:27] [INFO ] Dead Transitions using invariants and state equation in 8663 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18493 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s54178 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 21386 steps with 0 reset in 3090 ms.
FORMULA ServersAndClients-PT-400160-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400160-LTLFireability-02 finished in 22016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G(F(p0))))||X(G(p1))))'
Support contains 2 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1922 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
[2023-03-20 11:00:32] [INFO ] Invariant cache hit.
[2023-03-20 11:00:41] [INFO ] Implicit Places using invariants in 9118 ms returned []
Implicit Place search using SMT only with invariants took 9120 ms to find 0 implicit places.
[2023-03-20 11:00:41] [INFO ] Invariant cache hit.
[2023-03-20 11:00:49] [INFO ] Dead Transitions using invariants and state equation in 8073 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19126 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s19186 1), p0:(LT s25307 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][false, false, false, false]]
Product exploration timeout after 76380 steps with 0 reset in 10001 ms.
Product exploration timeout after 74520 steps with 0 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 284 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1646 ms. (steps per millisecond=6 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 3522 steps, run timeout after 6004 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 3522 steps, saw 1528 distinct states, run finished after 6006 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 11:01:20] [INFO ] Invariant cache hit.
[2023-03-20 11:01:45] [INFO ] [Real]Absence check using 561 positive place invariants in 4667 ms returned unknown
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 11:01:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 11:01:45] [INFO ] After 25240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 65761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Drop transitions removed 63998 transitions
Trivial Post-agglo rules discarded 63998 transitions
Performed 63998 trivial Post agglomeration. Transition count delta: 63998
Iterating post reduction 0 with 63998 rules applied. Total rules applied 63998 place count 65761 transition count 64802
Reduce places removed 64156 places and 0 transitions.
Ensure Unique test removed 62800 transitions
Reduce isomorphic transitions removed 62800 transitions.
Iterating post reduction 1 with 126956 rules applied. Total rules applied 190954 place count 1605 transition count 2002
Drop transitions removed 798 transitions
Redundant transition composition rules discarded 798 transitions
Iterating global reduction 2 with 798 rules applied. Total rules applied 191752 place count 1605 transition count 1204
Discarding 398 places :
Implicit places reduction removed 398 places
Drop transitions removed 796 transitions
Trivial Post-agglo rules discarded 796 transitions
Performed 796 trivial Post agglomeration. Transition count delta: 796
Iterating post reduction 2 with 1194 rules applied. Total rules applied 192946 place count 1207 transition count 408
Reduce places removed 1194 places and 0 transitions.
Drop transitions removed 398 transitions
Reduce isomorphic transitions removed 398 transitions.
Iterating post reduction 3 with 1592 rules applied. Total rules applied 194538 place count 13 transition count 10
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 194540 place count 13 transition count 10
Applied a total of 194540 rules in 3093 ms. Remains 13 /65761 variables (removed 65748) and now considering 10/128800 (removed 128790) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3093 ms. Remains : 13/65761 places, 10/128800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 13 cols
[2023-03-20 11:01:48] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-20 11:01:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-20 11:01:48] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 11:01:48] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 427 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1194 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
// Phase 1: matrix 128800 rows 65761 cols
[2023-03-20 11:01:53] [INFO ] Computed 961 place invariants in 3130 ms
[2023-03-20 11:02:01] [INFO ] Implicit Places using invariants in 11081 ms returned []
Implicit Place search using SMT only with invariants took 11086 ms to find 0 implicit places.
[2023-03-20 11:02:01] [INFO ] Invariant cache hit.
[2023-03-20 11:02:09] [INFO ] Dead Transitions using invariants and state equation in 7790 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20077 ms. Remains : 65761/65761 places, 128800/128800 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 p1 p0), (X p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1741 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1840 steps, run timeout after 3002 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 1840 steps, saw 884 distinct states, run finished after 3005 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 11:02:16] [INFO ] Invariant cache hit.
[2023-03-20 11:02:41] [INFO ] [Real]Absence check using 561 positive place invariants in 6363 ms returned unknown
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 11:02:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 11:02:41] [INFO ] After 25289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 65761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Drop transitions removed 63998 transitions
Trivial Post-agglo rules discarded 63998 transitions
Performed 63998 trivial Post agglomeration. Transition count delta: 63998
Iterating post reduction 0 with 63998 rules applied. Total rules applied 63998 place count 65761 transition count 64802
Reduce places removed 64156 places and 0 transitions.
Ensure Unique test removed 62800 transitions
Reduce isomorphic transitions removed 62800 transitions.
Iterating post reduction 1 with 126956 rules applied. Total rules applied 190954 place count 1605 transition count 2002
Drop transitions removed 798 transitions
Redundant transition composition rules discarded 798 transitions
Iterating global reduction 2 with 798 rules applied. Total rules applied 191752 place count 1605 transition count 1204
Discarding 398 places :
Implicit places reduction removed 398 places
Drop transitions removed 796 transitions
Trivial Post-agglo rules discarded 796 transitions
Performed 796 trivial Post agglomeration. Transition count delta: 796
Iterating post reduction 2 with 1194 rules applied. Total rules applied 192946 place count 1207 transition count 408
Reduce places removed 1194 places and 0 transitions.
Drop transitions removed 398 transitions
Reduce isomorphic transitions removed 398 transitions.
Iterating post reduction 3 with 1592 rules applied. Total rules applied 194538 place count 13 transition count 10
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 194540 place count 13 transition count 10
Applied a total of 194540 rules in 2921 ms. Remains 13 /65761 variables (removed 65748) and now considering 10/128800 (removed 128790) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2921 ms. Remains : 13/65761 places, 10/128800 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p1 p0), (X p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 255 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration timeout after 75820 steps with 0 reset in 10001 ms.
Product exploration timeout after 75260 steps with 0 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 65761 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Performed 10622 Post agglomeration using F-continuation condition.
Performed 21439 Post agglomeration using F-continuation condition.
Performed 32536 Post agglomeration using F-continuation condition.
Performed 44256 Post agglomeration using F-continuation condition.
Performed 56572 Post agglomeration using F-continuation condition.
Performed 63998 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63998 rules applied. Total rules applied 63998 place count 65761 transition count 128800
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 64155 place count 65604 transition count 66000
Deduced a syphon composed of 63998 places in 20 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 64312 place count 65604 transition count 66000
Deduced a syphon composed of 63998 places in 19 ms
Applied a total of 64312 rules in 170099 ms. Remains 65604 /65761 variables (removed 157) and now considering 66000/128800 (removed 62800) transitions.
[2023-03-20 11:05:55] [INFO ] Flow matrix only has 65202 transitions (discarded 798 similar events)
// Phase 1: matrix 65202 rows 65604 cols
[2023-03-20 11:07:17] [INFO ] Computed 804 place invariants in 81241 ms
[2023-03-20 11:07:25] [INFO ] Dead Transitions using invariants and state equation in 89340 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65604/65761 places, 66000/128800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259455 ms. Remains : 65604/65761 places, 66000/128800 transitions.
Built C files in :
/tmp/ltsmin75687272223212334
[2023-03-20 11:07:26] [INFO ] Built C files in 1430ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin75687272223212334
Running compilation step : cd /tmp/ltsmin75687272223212334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin75687272223212334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin75687272223212334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1279 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
// Phase 1: matrix 128800 rows 65761 cols
[2023-03-20 11:07:34] [INFO ] Computed 961 place invariants in 3147 ms
[2023-03-20 11:07:42] [INFO ] Implicit Places using invariants in 11422 ms returned []
Implicit Place search using SMT only with invariants took 11423 ms to find 0 implicit places.
[2023-03-20 11:07:42] [INFO ] Invariant cache hit.
[2023-03-20 11:07:50] [INFO ] Dead Transitions using invariants and state equation in 7839 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20548 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Built C files in :
/tmp/ltsmin8900281316646797297
[2023-03-20 11:07:51] [INFO ] Built C files in 1037ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8900281316646797297
Running compilation step : cd /tmp/ltsmin8900281316646797297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8900281316646797297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8900281316646797297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-20 11:08:02] [INFO ] Flatten gal took : 3429 ms
[2023-03-20 11:08:05] [INFO ] Flatten gal took : 3257 ms
[2023-03-20 11:08:05] [INFO ] Time to serialize gal into /tmp/LTL15950859701719595692.gal : 550 ms
[2023-03-20 11:08:05] [INFO ] Time to serialize properties into /tmp/LTL2830609288254288705.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15950859701719595692.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3493366451100406264.hoa' '-atoms' '/tmp/LTL2830609288254288705.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Detected timeout of ITS tools.
[2023-03-20 11:08:27] [INFO ] Flatten gal took : 3793 ms
[2023-03-20 11:08:30] [INFO ] Flatten gal took : 3212 ms
[2023-03-20 11:08:31] [INFO ] Time to serialize gal into /tmp/LTL7408606576052267561.gal : 440 ms
[2023-03-20 11:08:31] [INFO ] Time to serialize properties into /tmp/LTL2227865409095789428.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7408606576052267561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2227865409095789428.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-20 11:08:50] [INFO ] Flatten gal took : 3625 ms
[2023-03-20 11:08:50] [INFO ] Applying decomposition
[2023-03-20 11:08:53] [INFO ] Flatten gal took : 3601 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15379984389677885967.txt' '-o' '/tmp/graph15379984389677885967.bin' '-w' '/tmp/graph15379984389677885967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15379984389677885967.bin' '-l' '-1' '-v' '-w' '/tmp/graph15379984389677885967.weights' '-q' '0' '-e' '0.001'
[2023-03-20 11:09:04] [INFO ] Decomposing Gal with order
[2023-03-20 11:09:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 11:10:58] [INFO ] Removed a total of 127660 redundant transitions.
[2023-03-20 11:11:02] [INFO ] Flatten gal took : 36393 ms
[2023-03-20 11:11:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 902 labels/synchronizations in 5378 ms.
[2023-03-20 11:11:13] [INFO ] Time to serialize gal into /tmp/LTL14880411196122704759.gal : 864 ms
[2023-03-20 11:11:13] [INFO ] Time to serialize properties into /tmp/LTL8403635886356779654.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14880411196122704759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8403635886356779654.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6323727318826101717
[2023-03-20 11:11:30] [INFO ] Built C files in 1304ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6323727318826101717
Running compilation step : cd /tmp/ltsmin6323727318826101717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6323727318826101717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6323727318826101717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ServersAndClients-PT-400160-LTLFireability-05 finished in 662653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(p1))))))'
Support contains 3 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1334 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
[2023-03-20 11:11:34] [INFO ] Invariant cache hit.
[2023-03-20 11:11:42] [INFO ] Implicit Places using invariants in 8122 ms returned []
Implicit Place search using SMT only with invariants took 8124 ms to find 0 implicit places.
[2023-03-20 11:11:42] [INFO ] Invariant cache hit.
[2023-03-20 11:11:50] [INFO ] Dead Transitions using invariants and state equation in 7703 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17167 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s2287 1), p1:(AND (GEQ s989 1) (GEQ s28468 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 72740 steps with 49 reset in 10001 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 10 ms.
FORMULA ServersAndClients-PT-400160-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400160-LTLFireability-06 finished in 27466 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&&X((!p1 U (p2||G(!p1)))))||p0))))'
Support contains 4 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1303 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
[2023-03-20 11:12:02] [INFO ] Invariant cache hit.
[2023-03-20 11:12:10] [INFO ] Implicit Places using invariants in 8100 ms returned []
Implicit Place search using SMT only with invariants took 8111 ms to find 0 implicit places.
[2023-03-20 11:12:10] [INFO ] Invariant cache hit.
[2023-03-20 11:12:17] [INFO ] Dead Transitions using invariants and state equation in 7758 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17178 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1047 1) (GEQ s55736 1)), p0:(OR (LT s1421 1) (LT s55736 1)), p2:(LT s51861 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 63600 steps with 30 reset in 10001 ms.
Product exploration timeout after 70330 steps with 14 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 511 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1858 ms. (steps per millisecond=5 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 11:12:43] [INFO ] Invariant cache hit.
[2023-03-20 11:13:08] [INFO ] [Real]Absence check using 561 positive place invariants in 164 ms returned unknown
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 11:13:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 11:13:08] [INFO ] After 25123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 65761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Drop transitions removed 63281 transitions
Trivial Post-agglo rules discarded 63281 transitions
Performed 63281 trivial Post agglomeration. Transition count delta: 63281
Iterating post reduction 0 with 63281 rules applied. Total rules applied 63281 place count 65761 transition count 65519
Reduce places removed 63281 places and 0 transitions.
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Iterating post reduction 1 with 63599 rules applied. Total rules applied 126880 place count 2480 transition count 65201
Reduce places removed 476 places and 0 transitions.
Ensure Unique test removed 62800 transitions
Reduce isomorphic transitions removed 62800 transitions.
Iterating post reduction 2 with 63276 rules applied. Total rules applied 190156 place count 2004 transition count 2401
Drop transitions removed 399 transitions
Redundant transition composition rules discarded 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 190555 place count 2004 transition count 2002
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 3 with 398 rules applied. Total rules applied 190953 place count 2004 transition count 2002
Applied a total of 190953 rules in 7119 ms. Remains 2004 /65761 variables (removed 63757) and now considering 2002/128800 (removed 126798) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7119 ms. Remains : 2004/65761 places, 2002/128800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 995 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Probably explored full state space saw : 1202 states, properties seen :0
Probabilistic random walk after 3204 steps, saw 1202 distinct states, run finished after 231 ms. (steps per millisecond=13 ) properties seen :0
Explored full state space saw : 1202 states, properties seen :0
Exhaustive walk after 3204 steps, saw 1202 distinct states, run finished after 225 ms. (steps per millisecond=14 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p0) (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 11 factoid took 443 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-400160-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-400160-LTLFireability-08 finished in 76826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 3 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1270 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
[2023-03-20 11:13:18] [INFO ] Invariant cache hit.
[2023-03-20 11:13:27] [INFO ] Implicit Places using invariants in 8651 ms returned []
Implicit Place search using SMT only with invariants took 8661 ms to find 0 implicit places.
[2023-03-20 11:13:27] [INFO ] Invariant cache hit.
[2023-03-20 11:13:36] [INFO ] Dead Transitions using invariants and state equation in 8955 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18895 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s1013 1) (GEQ s59345 1)), p0:(LT s10642 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21183 steps with 0 reset in 3138 ms.
FORMULA ServersAndClients-PT-400160-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400160-LTLFireability-09 finished in 22431 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 1 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1650 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
[2023-03-20 11:13:41] [INFO ] Invariant cache hit.
[2023-03-20 11:13:50] [INFO ] Implicit Places using invariants in 8835 ms returned []
Implicit Place search using SMT only with invariants took 8840 ms to find 0 implicit places.
[2023-03-20 11:13:50] [INFO ] Invariant cache hit.
[2023-03-20 11:13:59] [INFO ] Dead Transitions using invariants and state equation in 8676 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19171 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s29076 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 65690 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 9 ms.
FORMULA ServersAndClients-PT-400160-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400160-LTLFireability-10 finished in 29523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0||X(G(p0)))) U ((!p0&&X((!p0||X(G(p0)))))||X(G((!p0||X(G(p0))))))))'
Support contains 2 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1557 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
[2023-03-20 11:14:11] [INFO ] Invariant cache hit.
[2023-03-20 11:14:19] [INFO ] Implicit Places using invariants in 8618 ms returned []
Implicit Place search using SMT only with invariants took 8621 ms to find 0 implicit places.
[2023-03-20 11:14:19] [INFO ] Invariant cache hit.
[2023-03-20 11:14:28] [INFO ] Dead Transitions using invariants and state equation in 9046 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19232 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Stuttering acceptance computed with spot in 144 ms :[false, false, (NOT p0), true]
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1013 1) (GEQ s38092 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 242 steps with 120 reset in 271 ms.
FORMULA ServersAndClients-PT-400160-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400160-LTLFireability-12 finished in 19914 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) U !p1) U X(p1)))'
Support contains 3 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1475 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
[2023-03-20 11:14:30] [INFO ] Invariant cache hit.
[2023-03-20 11:14:38] [INFO ] Implicit Places using invariants in 7934 ms returned []
Implicit Place search using SMT only with invariants took 7936 ms to find 0 implicit places.
[2023-03-20 11:14:38] [INFO ] Invariant cache hit.
[2023-03-20 11:14:47] [INFO ] Dead Transitions using invariants and state equation in 8916 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18335 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1353 1) (GEQ s52929 1)), p0:(GEQ s51003 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 timeout after 65360 steps with 42 reset in 10001 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 9 ms.
FORMULA ServersAndClients-PT-400160-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400160-LTLFireability-13 finished in 28834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F(p1)&&X((p2&&X((p2 U (!p0||G(p2)))))))))'
Support contains 6 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1411 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
[2023-03-20 11:14:59] [INFO ] Invariant cache hit.
[2023-03-20 11:15:07] [INFO ] Implicit Places using invariants in 7920 ms returned []
Implicit Place search using SMT only with invariants took 7924 ms to find 0 implicit places.
[2023-03-20 11:15:07] [INFO ] Invariant cache hit.
[2023-03-20 11:15:16] [INFO ] Dead Transitions using invariants and state equation in 8601 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17944 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), true, (NOT p1), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1193 1) (GEQ s42102 1)), p1:(AND (GEQ s1569 1) (GEQ s34884 1)), p2:(OR (LT s887 1) (LT s56137 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][false, false, false, false, false, false]]
Product exploration timeout after 68770 steps with 81 reset in 10001 ms.
Stack based approach found an accepted trace after 15 steps with 2 reset with depth 8 and stack size 8 in 14 ms.
FORMULA ServersAndClients-PT-400160-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400160-LTLFireability-14 finished in 28453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p0)||(!p0&&G(F(p1)))))))'
Support contains 3 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Applied a total of 0 rules in 1386 ms. Remains 65761 /65761 variables (removed 0) and now considering 128800/128800 (removed 0) transitions.
[2023-03-20 11:15:28] [INFO ] Invariant cache hit.
[2023-03-20 11:15:36] [INFO ] Implicit Places using invariants in 8047 ms returned []
Implicit Place search using SMT only with invariants took 8049 ms to find 0 implicit places.
[2023-03-20 11:15:36] [INFO ] Invariant cache hit.
[2023-03-20 11:15:44] [INFO ] Dead Transitions using invariants and state equation in 8204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17665 ms. Remains : 65761/65761 places, 128800/128800 transitions.
Stuttering acceptance computed with spot in 306 ms :[p0, (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(GEQ s16145 1), p0:(AND (GEQ s863 1) (GEQ s8418 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 67690 steps with 2 reset in 10001 ms.
Stack based approach found an accepted trace after 5723 steps with 0 reset with depth 5724 and stack size 210 in 794 ms.
FORMULA ServersAndClients-PT-400160-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400160-LTLFireability-15 finished in 29014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G(F(p0))))||X(G(p1))))'
Found a Lengthening insensitive property : ServersAndClients-PT-400160-LTLFireability-05
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 65761 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 65761/65761 places, 128800/128800 transitions.
Drop transitions removed 63998 transitions
Trivial Post-agglo rules discarded 63998 transitions
Performed 63998 trivial Post agglomeration. Transition count delta: 63998
Iterating post reduction 0 with 63998 rules applied. Total rules applied 63998 place count 65761 transition count 64802
Reduce places removed 64156 places and 0 transitions.
Ensure Unique test removed 62800 transitions
Reduce isomorphic transitions removed 62800 transitions.
Iterating post reduction 1 with 126956 rules applied. Total rules applied 190954 place count 1605 transition count 2002
Drop transitions removed 798 transitions
Redundant transition composition rules discarded 798 transitions
Iterating global reduction 2 with 798 rules applied. Total rules applied 191752 place count 1605 transition count 1204
Discarding 398 places :
Implicit places reduction removed 398 places
Drop transitions removed 796 transitions
Trivial Post-agglo rules discarded 796 transitions
Performed 796 trivial Post agglomeration. Transition count delta: 796
Iterating post reduction 2 with 1194 rules applied. Total rules applied 192946 place count 1207 transition count 408
Reduce places removed 1194 places and 0 transitions.
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Iterating post reduction 3 with 1591 rules applied. Total rules applied 194537 place count 13 transition count 11
Applied a total of 194537 rules in 3374 ms. Remains 13 /65761 variables (removed 65748) and now considering 11/128800 (removed 128789) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-20 11:15:59] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-20 11:15:59] [INFO ] Implicit Places using invariants in 34 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 36 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 7/65761 places, 11/128800 transitions.
Graph (trivial) has 7 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Applied a total of 1 rules in 5 ms. Remains 3 /7 variables (removed 4) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-20 11:15:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 11:15:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-20 11:15:59] [INFO ] Invariant cache hit.
[2023-03-20 11:15:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 3/65761 places, 5/128800 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3454 ms. Remains : 3/65761 places, 5/128800 transitions.
Running random walk in product with property : ServersAndClients-PT-400160-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s1 1), p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6258 reset in 159 ms.
Product exploration explored 100000 steps with 6359 reset in 165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 407 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 11:16:00] [INFO ] Invariant cache hit.
[2023-03-20 11:16:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-20 11:16:00] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 437 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-20 11:16:01] [INFO ] Invariant cache hit.
[2023-03-20 11:16:01] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 11:16:01] [INFO ] Invariant cache hit.
[2023-03-20 11:16:01] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-20 11:16:01] [INFO ] Invariant cache hit.
[2023-03-20 11:16:01] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 3/3 places, 5/5 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 p1 p0), true]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 256 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 362 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6242 reset in 108 ms.
Product exploration explored 100000 steps with 6279 reset in 264 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-20 11:16:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:16:03] [INFO ] Invariant cache hit.
[2023-03-20 11:16:03] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29 ms. Remains : 3/3 places, 5/5 transitions.
Built C files in :
/tmp/ltsmin3717278446580061190
[2023-03-20 11:16:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3717278446580061190
Running compilation step : cd /tmp/ltsmin3717278446580061190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 140 ms.
Running link step : cd /tmp/ltsmin3717278446580061190;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3717278446580061190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3602581072780979571.hoa' '--buchi-type=spotba'
LTSmin run took 300 ms.
Treatment of property ServersAndClients-PT-400160-LTLFireability-05 finished in 8342 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2023-03-20 11:16:08] [INFO ] Flatten gal took : 3749 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11543498586746059451
[2023-03-20 11:16:11] [INFO ] Too many transitions (128800) to apply POR reductions. Disabling POR matrices.
[2023-03-20 11:16:12] [INFO ] Built C files in 1630ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11543498586746059451
Running compilation step : cd /tmp/ltsmin11543498586746059451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-20 11:16:14] [INFO ] Applying decomposition
[2023-03-20 11:16:18] [INFO ] Flatten gal took : 4490 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6611969271318506089.txt' '-o' '/tmp/graph6611969271318506089.bin' '-w' '/tmp/graph6611969271318506089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6611969271318506089.bin' '-l' '-1' '-v' '-w' '/tmp/graph6611969271318506089.weights' '-q' '0' '-e' '0.001'
[2023-03-20 11:16:29] [INFO ] Decomposing Gal with order
[2023-03-20 11:16:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 11:18:38] [INFO ] Removed a total of 127676 redundant transitions.
[2023-03-20 11:18:42] [INFO ] Flatten gal took : 37355 ms
[2023-03-20 11:18:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 590 ms.
[2023-03-20 11:18:48] [INFO ] Time to serialize gal into /tmp/LTLFireability5831626681046808374.gal : 802 ms
[2023-03-20 11:18:48] [INFO ] Time to serialize properties into /tmp/LTLFireability6863583877332070427.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5831626681046808374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6863583877332070427.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(("(u46.sv59_c46<1)")&&(G(F("(u46.sv59_c46<1)")))))||(X(G("(u341.sv43_c341<1)")))))
Formula 0 simplified : X(FG!"(u46.sv59_c46<1)" & F!"(u341.sv43_c341<1)")
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11543498586746059451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11543498586746059451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-20 11:44:52] [INFO ] Flatten gal took : 4339 ms
[2023-03-20 11:44:53] [INFO ] Time to serialize gal into /tmp/LTLFireability2359568953664357110.gal : 506 ms
[2023-03-20 11:44:53] [INFO ] Time to serialize properties into /tmp/LTLFireability3573581558316428386.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2359568953664357110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3573581558316428386.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !(((F(("(sv59_c46<1)")&&(G(F("(sv59_c46<1)")))))||(X(G("(sv43_c341<1)")))))
Formula 0 simplified : X(FG!"(sv59_c46<1)" & F!"(sv43_c341<1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10101296 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11408316 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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-400160"
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-400160, 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-167891806600540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-400160.tgz
mv ServersAndClients-PT-400160 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 '
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 ;