About the Execution of LoLa+red for ServersAndClients-PT-100080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2451.812 | 249127.00 | 338360.00 | 1380.20 | FTTFFFFFFFTFFFFF | 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.r359-smll-167891809000476.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 lolaxred
Input is ServersAndClients-PT-100080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891809000476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 7.6K Feb 26 03:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 03:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 03:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 03:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 03:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 26 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 4.9M 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-100080-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679119934897
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100080
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 06:12:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 06:12:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 06:12:19] [INFO ] Load time of PNML (sax parser for PT used): 828 ms
[2023-03-18 06:12:19] [INFO ] Transformed 8481 places.
[2023-03-18 06:12:19] [INFO ] Transformed 16200 transitions.
[2023-03-18 06:12:19] [INFO ] Parsed PT model containing 8481 places and 16200 transitions and 48800 arcs in 1042 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-100080-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 3655 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2023-03-18 06:12:24] [INFO ] Computed 281 place invariants in 423 ms
[2023-03-18 06:12:26] [INFO ] Implicit Places using invariants in 2363 ms returned []
Implicit Place search using SMT only with invariants took 2407 ms to find 0 implicit places.
[2023-03-18 06:12:26] [INFO ] Invariant cache hit.
[2023-03-18 06:12:27] [INFO ] Dead Transitions using invariants and state equation in 1618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7693 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Support contains 48 out of 8481 places after structural reductions.
[2023-03-18 06:12:29] [INFO ] Flatten gal took : 1076 ms
[2023-03-18 06:12:30] [INFO ] Flatten gal took : 651 ms
[2023-03-18 06:12:31] [INFO ] Input system was already deterministic with 16200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1180 ms. (steps per millisecond=8 ) properties (out of 34) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-18 06:12:33] [INFO ] Invariant cache hit.
[2023-03-18 06:12:38] [INFO ] [Real]Absence check using 181 positive place invariants in 771 ms returned sat
[2023-03-18 06:12:38] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 279 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-18 06:12:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 06:12:58] [INFO ] After 25029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 8481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7986 transitions
Trivial Post-agglo rules discarded 7986 transitions
Performed 7986 trivial Post agglomeration. Transition count delta: 7986
Iterating post reduction 0 with 7986 rules applied. Total rules applied 7986 place count 8481 transition count 8214
Reduce places removed 8055 places and 0 transitions.
Ensure Unique test removed 6800 transitions
Reduce isomorphic transitions removed 6800 transitions.
Iterating post reduction 1 with 14855 rules applied. Total rules applied 22841 place count 426 transition count 1414
Drop transitions removed 1086 transitions
Redundant transition composition rules discarded 1086 transitions
Iterating global reduction 2 with 1086 rules applied. Total rules applied 23927 place count 426 transition count 328
Discarding 87 places :
Implicit places reduction removed 87 places
Drop transitions removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 2 with 261 rules applied. Total rules applied 24188 place count 339 transition count 154
Reduce places removed 261 places and 0 transitions.
Drop transitions removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 3 with 348 rules applied. Total rules applied 24536 place count 78 transition count 67
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 24549 place count 78 transition count 67
Applied a total of 24549 rules in 325 ms. Remains 78 /8481 variables (removed 8403) and now considering 67/16200 (removed 16133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 78/8481 places, 67/16200 transitions.
Finished random walk after 280 steps, including 0 resets, run visited all 14 properties in 5 ms. (steps per millisecond=56 )
FORMULA ServersAndClients-PT-100080-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((F(p2)&&p1))))'
Support contains 5 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7643 transitions
Trivial Post-agglo rules discarded 7643 transitions
Performed 7643 trivial Post agglomeration. Transition count delta: 7643
Iterating post reduction 0 with 7643 rules applied. Total rules applied 7643 place count 8481 transition count 8557
Reduce places removed 7643 places and 0 transitions.
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Iterating post reduction 1 with 7799 rules applied. Total rules applied 15442 place count 838 transition count 8401
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 7600 transitions
Reduce isomorphic transitions removed 7600 transitions.
Iterating post reduction 2 with 7833 rules applied. Total rules applied 23275 place count 605 transition count 801
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 23374 place count 605 transition count 702
Applied a total of 23374 rules in 481 ms. Remains 605 /8481 variables (removed 7876) and now considering 702/16200 (removed 15498) transitions.
// Phase 1: matrix 702 rows 605 cols
[2023-03-18 06:12:59] [INFO ] Computed 204 place invariants in 15 ms
[2023-03-18 06:13:00] [INFO ] Implicit Places using invariants in 605 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 401]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 609 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/8481 places, 702/16200 transitions.
Graph (trivial) has 296 edges and 404 vertex of which 197 / 404 are part of one of the 1 SCC in 3 ms
Free SCC test removed 196 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 196 place count 13 transition count 214
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 13 transition count 214
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 585 place count 13 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 587 place count 11 transition count 18
Iterating global reduction 1 with 2 rules applied. Total rules applied 589 place count 11 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 591 place count 10 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 593 place count 8 transition count 15
Iterating global reduction 1 with 2 rules applied. Total rules applied 595 place count 8 transition count 15
Applied a total of 595 rules in 24 ms. Remains 8 /404 variables (removed 396) and now considering 15/702 (removed 687) transitions.
// Phase 1: matrix 15 rows 8 cols
[2023-03-18 06:13:00] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 06:13:00] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 06:13:00] [INFO ] Invariant cache hit.
[2023-03-18 06:13:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/8481 places, 15/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1162 ms. Remains : 8/8481 places, 15/16200 transitions.
Stuttering acceptance computed with spot in 431 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s6 1)), p1:(AND (GEQ s0 1) (GEQ s4 1)), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-00 finished in 1704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0 U (p1||G(p0)))||(X(p2)&&G(p3)))))))'
Support contains 4 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 3388 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2023-03-18 06:13:04] [INFO ] Computed 281 place invariants in 232 ms
[2023-03-18 06:13:05] [INFO ] Implicit Places using invariants in 1694 ms returned []
Implicit Place search using SMT only with invariants took 1696 ms to find 0 implicit places.
[2023-03-18 06:13:05] [INFO ] Invariant cache hit.
[2023-03-18 06:13:07] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6481 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 596 ms :[true, (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p3 p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={} source=2 dest: 6}, { cond=(OR (AND (NOT p3) (NOT p1) p0) (AND (NOT p1) p0 (NOT p2))), acceptance={} source=2 dest: 9}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={} source=7 dest: 4}], [{ cond=true, acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 9}]], initial=8, aps=[p3:(GEQ s5021 1), p2:(OR (GEQ s6451 1) (GEQ s2463 1)), p1:(AND (LT s2689 1) (LT s2463 1)), p0:(LT s2463 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 6069 ms.
Product exploration explored 100000 steps with 25000 reset in 5213 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 10 states, 22 edges and 4 AP (stutter sensitive) to 10 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 554 ms :[true, (NOT p3), (OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 950 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :3
Running SMT prover for 6 properties.
[2023-03-18 06:13:21] [INFO ] Invariant cache hit.
[2023-03-18 06:13:25] [INFO ] [Real]Absence check using 181 positive place invariants in 770 ms returned sat
[2023-03-18 06:13:25] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 254 ms returned sat
[2023-03-18 06:13:25] [INFO ] After 3720ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:2
[2023-03-18 06:13:27] [INFO ] [Nat]Absence check using 181 positive place invariants in 557 ms returned sat
[2023-03-18 06:13:27] [INFO ] [Nat]Absence check using 181 positive and 100 generalized place invariants in 208 ms returned sat
[2023-03-18 06:13:28] [INFO ] After 2648ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 p0), true, (G (NOT (AND p3 p2 p0 (NOT p1)))), (G (NOT (AND p3 p2 (NOT p0) (NOT p1)))), (G (NOT (AND p3 p0 (NOT p1)))), (G (NOT (AND p3 p2))), (G (OR (NOT p3) (NOT p2))), (G (NOT (AND p3 (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p3) p0 (NOT p1)) (AND (NOT p2) p0 (NOT p1)))), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1)))), (F p3), (F (AND (NOT p3) p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 609 ms. Reduced automaton from 10 states, 22 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p3) p1), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p3) p1), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 3 out of 8481 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 3110 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
[2023-03-18 06:13:32] [INFO ] Invariant cache hit.
[2023-03-18 06:13:33] [INFO ] Implicit Places using invariants in 1311 ms returned []
Implicit Place search using SMT only with invariants took 1327 ms to find 0 implicit places.
[2023-03-18 06:13:33] [INFO ] Invariant cache hit.
[2023-03-18 06:13:34] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5607 ms. Remains : 8481/8481 places, 16200/16200 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 (NOT p3) p0), (X (OR p1 (NOT p3))), (X (X (OR p1 (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p3) p1), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 06:13:35] [INFO ] Invariant cache hit.
[2023-03-18 06:13:38] [INFO ] [Real]Absence check using 181 positive place invariants in 750 ms returned sat
[2023-03-18 06:13:38] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 244 ms returned sat
[2023-03-18 06:13:55] [INFO ] After 16703ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-18 06:13:56] [INFO ] After 17935ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 801 ms.
[2023-03-18 06:13:57] [INFO ] After 21475ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Parikh walk visited 1 properties in 20 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p3) p0), (X (OR p1 (NOT p3))), (X (X (OR p1 (NOT p3)))), (G (OR p1 (NOT p3)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 217 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 5146 ms.
Product exploration explored 100000 steps with 25000 reset in 4944 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Performed 7998 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7998 rules applied. Total rules applied 7998 place count 8481 transition count 16200
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 8075 place count 8404 transition count 8500
Deduced a syphon composed of 7998 places in 2 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 8152 place count 8404 transition count 8500
Discarding 7700 places :
Symmetric choice reduction at 1 with 7700 rule applications. Total rules 15852 place count 704 transition count 800
Deduced a syphon composed of 298 places in 1 ms
Iterating global reduction 1 with 7700 rules applied. Total rules applied 23552 place count 704 transition count 800
Deduced a syphon composed of 298 places in 1 ms
Applied a total of 23552 rules in 6235 ms. Remains 704 /8481 variables (removed 7777) and now considering 800/16200 (removed 15400) transitions.
[2023-03-18 06:14:14] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-18 06:14:14] [INFO ] Flow matrix only has 602 transitions (discarded 198 similar events)
// Phase 1: matrix 602 rows 704 cols
[2023-03-18 06:14:15] [INFO ] Computed 204 place invariants in 26 ms
[2023-03-18 06:14:15] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 704/8481 places, 800/16200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7238 ms. Remains : 704/8481 places, 800/16200 transitions.
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2574 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2023-03-18 06:14:18] [INFO ] Computed 281 place invariants in 117 ms
[2023-03-18 06:14:19] [INFO ] Implicit Places using invariants in 1383 ms returned []
Implicit Place search using SMT only with invariants took 1385 ms to find 0 implicit places.
[2023-03-18 06:14:19] [INFO ] Invariant cache hit.
[2023-03-18 06:14:21] [INFO ] Dead Transitions using invariants and state equation in 1111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5074 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Treatment of property ServersAndClients-PT-100080-LTLFireability-02 finished in 81225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||F(G(p2))))))'
Support contains 5 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2926 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
[2023-03-18 06:14:25] [INFO ] Invariant cache hit.
[2023-03-18 06:14:26] [INFO ] Implicit Places using invariants in 1105 ms returned []
Implicit Place search using SMT only with invariants took 1107 ms to find 0 implicit places.
[2023-03-18 06:14:26] [INFO ] Invariant cache hit.
[2023-03-18 06:14:27] [INFO ] Dead Transitions using invariants and state equation in 1326 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5362 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s219 1) (GEQ s401 1)), p1:(GEQ s4166 1), p2:(AND (OR (LT s219 1) (LT s401 1)) (OR (LT s94 1) (LT s200 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 explored 100000 steps with 0 reset in 3167 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-04 finished in 8758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!F(G(((p0 U p1)||p2))) U G(X(G(p0)))))'
Support contains 5 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2411 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
[2023-03-18 06:14:33] [INFO ] Invariant cache hit.
[2023-03-18 06:14:34] [INFO ] Implicit Places using invariants in 1403 ms returned []
Implicit Place search using SMT only with invariants took 1404 ms to find 0 implicit places.
[2023-03-18 06:14:34] [INFO ] Invariant cache hit.
[2023-03-18 06:14:36] [INFO ] Dead Transitions using invariants and state equation in 1335 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5151 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (NOT p0), (OR p2 p1), (OR (AND p0 p2) (AND p0 p1)), p1]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s5890 1), p2:(AND (GEQ s395 1) (GEQ s2118 1)), p1:(AND (GEQ s229 1) (GEQ s4138 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25014 reset in 5558 ms.
Stack based approach found an accepted trace after 1525 steps with 380 reset with depth 8 and stack size 8 in 87 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-05 finished in 11157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7644 transitions
Trivial Post-agglo rules discarded 7644 transitions
Performed 7644 trivial Post agglomeration. Transition count delta: 7644
Iterating post reduction 0 with 7644 rules applied. Total rules applied 7644 place count 8481 transition count 8556
Reduce places removed 7644 places and 0 transitions.
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Iterating post reduction 1 with 7800 rules applied. Total rules applied 15444 place count 837 transition count 8400
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 7700 transitions
Reduce isomorphic transitions removed 7700 transitions.
Iterating post reduction 2 with 7934 rules applied. Total rules applied 23378 place count 603 transition count 700
Applied a total of 23378 rules in 153 ms. Remains 603 /8481 variables (removed 7878) and now considering 700/16200 (removed 15500) transitions.
// Phase 1: matrix 700 rows 603 cols
[2023-03-18 06:14:42] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-18 06:14:42] [INFO ] Implicit Places using invariants in 698 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 701 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/8481 places, 700/16200 transitions.
Graph (trivial) has 296 edges and 403 vertex of which 197 / 403 are part of one of the 1 SCC in 0 ms
Free SCC test removed 196 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 196 place count 12 transition count 212
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 12 transition count 212
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 585 place count 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 587 place count 10 transition count 16
Iterating global reduction 1 with 2 rules applied. Total rules applied 589 place count 10 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 591 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 593 place count 7 transition count 13
Iterating global reduction 1 with 2 rules applied. Total rules applied 595 place count 7 transition count 13
Applied a total of 595 rules in 12 ms. Remains 7 /403 variables (removed 396) and now considering 13/700 (removed 687) transitions.
// Phase 1: matrix 13 rows 7 cols
[2023-03-18 06:14:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 06:14:42] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 06:14:42] [INFO ] Invariant cache hit.
[2023-03-18 06:14:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/8481 places, 13/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 922 ms. Remains : 7/8481 places, 13/16200 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s5 1)), p1:(OR (LT s0 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-06 finished in 1113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 3026 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2023-03-18 06:14:46] [INFO ] Computed 281 place invariants in 166 ms
[2023-03-18 06:14:47] [INFO ] Implicit Places using invariants in 1480 ms returned []
Implicit Place search using SMT only with invariants took 1481 ms to find 0 implicit places.
[2023-03-18 06:14:47] [INFO ] Invariant cache hit.
[2023-03-18 06:14:48] [INFO ] Dead Transitions using invariants and state equation in 1290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5799 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s387 1) (GEQ s3431 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-07 finished in 5970 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 4 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2845 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
[2023-03-18 06:14:51] [INFO ] Invariant cache hit.
[2023-03-18 06:14:53] [INFO ] Implicit Places using invariants in 1358 ms returned []
Implicit Place search using SMT only with invariants took 1359 ms to find 0 implicit places.
[2023-03-18 06:14:53] [INFO ] Invariant cache hit.
[2023-03-18 06:14:54] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5349 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s317 1) (GEQ s7269 1)) (AND (GEQ s319 1) (GEQ s5350 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 explored 100000 steps with 475 reset in 3176 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-08 finished in 8680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8481 transition count 8201
Reduce places removed 8078 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 1 with 15878 rules applied. Total rules applied 23877 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 23976 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 24273 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 24668 place count 7 transition count 6
Applied a total of 24668 rules in 104 ms. Remains 7 /8481 variables (removed 8474) and now considering 6/16200 (removed 16194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-18 06:14:57] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 06:14:57] [INFO ] Implicit Places using invariants in 26 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/8481 places, 6/16200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-18 06:14:57] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 06:14:57] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 06:14:57] [INFO ] Invariant cache hit.
[2023-03-18 06:14:57] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/8481 places, 3/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 2/8481 places, 3/16200 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-09 finished in 223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p1))||p0)))'
Support contains 5 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7643 transitions
Trivial Post-agglo rules discarded 7643 transitions
Performed 7643 trivial Post agglomeration. Transition count delta: 7643
Iterating post reduction 0 with 7643 rules applied. Total rules applied 7643 place count 8481 transition count 8557
Reduce places removed 7643 places and 0 transitions.
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Iterating post reduction 1 with 7799 rules applied. Total rules applied 15442 place count 838 transition count 8401
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 7600 transitions
Reduce isomorphic transitions removed 7600 transitions.
Iterating post reduction 2 with 7833 rules applied. Total rules applied 23275 place count 605 transition count 801
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 23374 place count 605 transition count 702
Applied a total of 23374 rules in 170 ms. Remains 605 /8481 variables (removed 7876) and now considering 702/16200 (removed 15498) transitions.
// Phase 1: matrix 702 rows 605 cols
[2023-03-18 06:14:58] [INFO ] Computed 204 place invariants in 4 ms
[2023-03-18 06:14:58] [INFO ] Implicit Places using invariants in 615 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 401]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 617 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/8481 places, 702/16200 transitions.
Graph (trivial) has 296 edges and 404 vertex of which 197 / 404 are part of one of the 1 SCC in 0 ms
Free SCC test removed 196 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 196 place count 13 transition count 214
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 13 transition count 214
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 585 place count 13 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 587 place count 11 transition count 18
Iterating global reduction 1 with 2 rules applied. Total rules applied 589 place count 11 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 591 place count 10 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 593 place count 8 transition count 15
Iterating global reduction 1 with 2 rules applied. Total rules applied 595 place count 8 transition count 15
Applied a total of 595 rules in 11 ms. Remains 8 /404 variables (removed 396) and now considering 15/702 (removed 687) transitions.
// Phase 1: matrix 15 rows 8 cols
[2023-03-18 06:14:58] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 06:14:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 06:14:58] [INFO ] Invariant cache hit.
[2023-03-18 06:14:58] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/8481 places, 15/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 862 ms. Remains : 8/8481 places, 15/16200 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s4 1)), p1:(OR (AND (GEQ s3 1) (GEQ s0 1) (GEQ s6 1)) (AND (LT s3 1) (OR (LT s0 1) (LT s6 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4031 reset in 222 ms.
Product exploration explored 100000 steps with 4065 reset in 197 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-18 06:15:00] [INFO ] Invariant cache hit.
[2023-03-18 06:15:00] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 06:15:00] [INFO ] Invariant cache hit.
[2023-03-18 06:15:00] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-18 06:15:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 06:15:00] [INFO ] Invariant cache hit.
[2023-03-18 06:15:00] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 8/8 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4016 reset in 238 ms.
Product exploration explored 100000 steps with 4014 reset in 267 ms.
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-18 06:15:01] [INFO ] Invariant cache hit.
[2023-03-18 06:15:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 06:15:01] [INFO ] Invariant cache hit.
[2023-03-18 06:15:01] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-18 06:15:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 06:15:01] [INFO ] Invariant cache hit.
[2023-03-18 06:15:01] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 8/8 places, 15/15 transitions.
Treatment of property ServersAndClients-PT-100080-LTLFireability-10 finished in 3857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7821 transitions
Trivial Post-agglo rules discarded 7821 transitions
Performed 7821 trivial Post agglomeration. Transition count delta: 7821
Iterating post reduction 0 with 7821 rules applied. Total rules applied 7821 place count 8481 transition count 8379
Reduce places removed 7821 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 7900 rules applied. Total rules applied 15721 place count 660 transition count 8300
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 2 with 7958 rules applied. Total rules applied 23679 place count 502 transition count 500
Applied a total of 23679 rules in 157 ms. Remains 502 /8481 variables (removed 7979) and now considering 500/16200 (removed 15700) transitions.
// Phase 1: matrix 500 rows 502 cols
[2023-03-18 06:15:01] [INFO ] Computed 202 place invariants in 3 ms
[2023-03-18 06:15:02] [INFO ] Implicit Places using invariants in 501 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 507 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/8481 places, 500/16200 transitions.
Graph (trivial) has 298 edges and 302 vertex of which 199 / 302 are part of one of the 1 SCC in 0 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 6 transition count 106
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 4 transition count 6
Applied a total of 299 rules in 7 ms. Remains 4 /302 variables (removed 298) and now considering 6/500 (removed 494) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-18 06:15:02] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 06:15:02] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 06:15:02] [INFO ] Invariant cache hit.
[2023-03-18 06:15:02] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/8481 places, 6/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 712 ms. Remains : 4/8481 places, 6/16200 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-11 finished in 770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((F(!(p0 U p1))||p0)))&&X(G(p2)))))'
Support contains 4 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2821 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2023-03-18 06:15:05] [INFO ] Computed 281 place invariants in 105 ms
[2023-03-18 06:15:06] [INFO ] Implicit Places using invariants in 1439 ms returned []
Implicit Place search using SMT only with invariants took 1440 ms to find 0 implicit places.
[2023-03-18 06:15:06] [INFO ] Invariant cache hit.
[2023-03-18 06:15:08] [INFO ] Dead Transitions using invariants and state equation in 1299 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5566 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) p1)), true, (OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (AND p2 p0) (AND p2 (NOT p1))), acceptance={0} source=4 dest: 0}, { cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(GEQ s2455 1), p0:(GEQ s8355 1), p1:(AND (GEQ s291 1) (GEQ s3734 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-12 finished in 5771 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(X(F(p1))))))'
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2793 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
[2023-03-18 06:15:11] [INFO ] Invariant cache hit.
[2023-03-18 06:15:12] [INFO ] Implicit Places using invariants in 1284 ms returned []
Implicit Place search using SMT only with invariants took 1285 ms to find 0 implicit places.
[2023-03-18 06:15:12] [INFO ] Invariant cache hit.
[2023-03-18 06:15:13] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5576 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (GEQ s785 1) (LT s6832 1)), p0:(GEQ s785 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, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-13 finished in 5775 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(p0) U p1))||X(F(G(X(p2))))))'
Support contains 4 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2744 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
[2023-03-18 06:15:16] [INFO ] Invariant cache hit.
[2023-03-18 06:15:18] [INFO ] Implicit Places using invariants in 1329 ms returned []
Implicit Place search using SMT only with invariants took 1329 ms to find 0 implicit places.
[2023-03-18 06:15:18] [INFO ] Invariant cache hit.
[2023-03-18 06:15:19] [INFO ] Dead Transitions using invariants and state equation in 1333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5408 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s2461 1), p0:(AND (GEQ s357 1) (GEQ s2219 1)), p2:(LT s6028 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3140 ms.
Stack based approach found an accepted trace after 5378 steps with 0 reset with depth 5379 and stack size 1440 in 161 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-14 finished in 8905 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))&&(G(!F(p0))||p0))) U p1))'
Support contains 4 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2785 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
[2023-03-18 06:15:25] [INFO ] Invariant cache hit.
[2023-03-18 06:15:27] [INFO ] Implicit Places using invariants in 1311 ms returned []
Implicit Place search using SMT only with invariants took 1311 ms to find 0 implicit places.
[2023-03-18 06:15:27] [INFO ] Invariant cache hit.
[2023-03-18 06:15:28] [INFO ] Dead Transitions using invariants and state equation in 1316 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5414 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s289 1) (GEQ s5653 1)), p1:(AND (GEQ s261 1) (GEQ s1007 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, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-15 finished in 5632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0 U (p1||G(p0)))||(X(p2)&&G(p3)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p1))||p0)))'
[2023-03-18 06:15:29] [INFO ] Flatten gal took : 605 ms
[2023-03-18 06:15:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-18 06:15:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8481 places, 16200 transitions and 48800 arcs took 84 ms.
Total runtime 191174 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ServersAndClients-PT-100080
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability
FORMULA ServersAndClients-PT-100080-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ServersAndClients-PT-100080-LTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679120184024
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ServersAndClients-PT-100080-LTLFireability-02: LTL 0 0 0 0 1 0 0 0
ServersAndClients-PT-100080-LTLFireability-10: LTL 0 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 29 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ServersAndClients-PT-100080-LTLFireability-02: LTL 0 0 0 0 1 0 0 0
ServersAndClients-PT-100080-LTLFireability-10: LTL 0 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 34 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ServersAndClients-PT-100080-LTLFireability-02: LTL 0 0 0 0 1 0 0 0
ServersAndClients-PT-100080-LTLFireability-10: LTL 0 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 39 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ServersAndClients-PT-100080-LTLFireability-02: LTL 0 0 0 0 1 0 0 0
ServersAndClients-PT-100080-LTLFireability-10: LTL 0 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 44 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 ServersAndClients-PT-100080-LTLFireability-10
lola: time limit : 1775 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ServersAndClients-PT-100080-LTLFireability-02: LTL 0 0 0 0 1 0 0 0
ServersAndClients-PT-100080-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 0/1775 1/32 ServersAndClients-PT-100080-LTLFireability-10 738 m, 147 m/sec, 1456 t fired, .
Time elapsed: 49 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 4 (type EXCL) for ServersAndClients-PT-100080-LTLFireability-10
lola: result : true
lola: markings : 8281
lola: fired transitions : 16280
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ServersAndClients-PT-100080-LTLFireability-02
lola: time limit : 3548 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ServersAndClients-PT-100080-LTLFireability-02
lola: result : true
lola: markings : 8301
lola: fired transitions : 24100
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ServersAndClients-PT-100080-LTLFireability-02: LTL true LTL model checker
ServersAndClients-PT-100080-LTLFireability-10: LTL true LTL model checker
Time elapsed: 53 secs. Pages in use: 1
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-100080"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ServersAndClients-PT-100080, 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 r359-smll-167891809000476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-100080.tgz
mv ServersAndClients-PT-100080 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 ;