Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r361-smll-167891811600492.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ServersAndClients-PT-100320, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811600492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 7.8K Feb 26 03:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 03:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 03:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 03:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 04:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 04:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 20M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679312708802

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100320
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 11:45:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 11:45:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:45:13] [INFO ] Load time of PNML (sax parser for PT used): 1625 ms
[2023-03-20 11:45:13] [INFO ] Transformed 32721 places.
[2023-03-20 11:45:13] [INFO ] Transformed 64200 transitions.
[2023-03-20 11:45:13] [INFO ] Parsed PT model containing 32721 places and 64200 transitions and 192800 arcs in 1970 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ServersAndClients-PT-100320-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100320-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 614 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2023-03-20 11:45:16] [INFO ] Computed 521 place invariants in 1289 ms
[2023-03-20 11:45:21] [INFO ] Implicit Places using invariants in 6352 ms returned []
Implicit Place search using SMT only with invariants took 6394 ms to find 0 implicit places.
[2023-03-20 11:45:21] [INFO ] Invariant cache hit.
[2023-03-20 11:45:25] [INFO ] Dead Transitions using invariants and state equation in 4450 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11472 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Support contains 46 out of 32721 places after structural reductions.
[2023-03-20 11:45:29] [INFO ] Flatten gal took : 2457 ms
[2023-03-20 11:45:30] [INFO ] Flatten gal took : 1918 ms
[2023-03-20 11:45:34] [INFO ] Input system was already deterministic with 64200 transitions.
Support contains 44 out of 32721 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1435 ms. (steps per millisecond=6 ) properties (out of 27) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) 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 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :1
Running SMT prover for 8 properties.
[2023-03-20 11:45:37] [INFO ] Invariant cache hit.
[2023-03-20 11:45:55] [INFO ] [Real]Absence check using 421 positive place invariants in 4904 ms returned sat
[2023-03-20 11:45:56] [INFO ] [Real]Absence check using 421 positive and 100 generalized place invariants in 827 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 11:46:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 11:46:02] [INFO ] After 25076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 32721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31993 transitions
Trivial Post-agglo rules discarded 31993 transitions
Performed 31993 trivial Post agglomeration. Transition count delta: 31993
Iterating post reduction 0 with 31993 rules applied. Total rules applied 31993 place count 32721 transition count 32207
Reduce places removed 32306 places and 0 transitions.
Ensure Unique test removed 31200 transitions
Reduce isomorphic transitions removed 31200 transitions.
Iterating post reduction 1 with 63506 rules applied. Total rules applied 95499 place count 415 transition count 1007
Drop transitions removed 693 transitions
Redundant transition composition rules discarded 693 transitions
Iterating global reduction 2 with 693 rules applied. Total rules applied 96192 place count 415 transition count 314
Discarding 95 places :
Implicit places reduction removed 95 places
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 2 with 285 rules applied. Total rules applied 96477 place count 320 transition count 124
Reduce places removed 285 places and 0 transitions.
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 3 with 380 rules applied. Total rules applied 96857 place count 35 transition count 29
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 96862 place count 35 transition count 29
Applied a total of 96862 rules in 1468 ms. Remains 35 /32721 variables (removed 32686) and now considering 29/64200 (removed 64171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1468 ms. Remains : 35/32721 places, 29/64200 transitions.
Finished random walk after 88 steps, including 0 resets, run visited all 6 properties in 9 ms. (steps per millisecond=9 )
FORMULA ServersAndClients-PT-100320-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA ServersAndClients-PT-100320-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 718 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 11:46:05] [INFO ] Invariant cache hit.
[2023-03-20 11:46:10] [INFO ] Implicit Places using invariants in 4618 ms returned []
Implicit Place search using SMT only with invariants took 4619 ms to find 0 implicit places.
[2023-03-20 11:46:10] [INFO ] Invariant cache hit.
[2023-03-20 11:46:14] [INFO ] Dead Transitions using invariants and state equation in 4457 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9800 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 370 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (AND (OR (LT s293 1) (LT s18379 1)) (OR (LT s309 1) (LT s11814 1))) (AND (GEQ s309 1) (GEQ s11814 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]]
Product exploration timeout after 39480 steps with 9870 reset in 10002 ms.
Product exploration timeout after 45220 steps with 11305 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 201 steps, including 0 resets, run visited all 1 properties in 29 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 428 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 11:46:37] [INFO ] Invariant cache hit.
[2023-03-20 11:46:41] [INFO ] Implicit Places using invariants in 3998 ms returned []
Implicit Place search using SMT only with invariants took 4006 ms to find 0 implicit places.
[2023-03-20 11:46:41] [INFO ] Invariant cache hit.
[2023-03-20 11:46:45] [INFO ] Dead Transitions using invariants and state equation in 4332 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8788 ms. Remains : 32721/32721 places, 64200/64200 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 557 steps, including 0 resets, run visited all 1 properties in 76 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 40900 steps with 10225 reset in 10004 ms.
Product exploration timeout after 44400 steps with 11100 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Performed 31800 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31800 rules applied. Total rules applied 31800 place count 32721 transition count 64200
Discarding 317 places :
Symmetric choice reduction at 1 with 317 rule applications. Total rules 32117 place count 32404 transition count 32500
Deduced a syphon composed of 31800 places in 7 ms
Iterating global reduction 1 with 317 rules applied. Total rules applied 32434 place count 32404 transition count 32500
Deduced a syphon composed of 31800 places in 8 ms
Applied a total of 32434 rules in 31315 ms. Remains 32404 /32721 variables (removed 317) and now considering 32500/64200 (removed 31700) transitions.
// Phase 1: matrix 32500 rows 32404 cols
[2023-03-20 11:48:00] [INFO ] Computed 204 place invariants in 21168 ms
[2023-03-20 11:48:05] [INFO ] Dead Transitions using invariants and state equation in 25415 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32404/32721 places, 32500/64200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56742 ms. Remains : 32404/32721 places, 32500/64200 transitions.
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 483 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2023-03-20 11:48:06] [INFO ] Computed 521 place invariants in 765 ms
[2023-03-20 11:48:10] [INFO ] Implicit Places using invariants in 4898 ms returned []
Implicit Place search using SMT only with invariants took 4928 ms to find 0 implicit places.
[2023-03-20 11:48:10] [INFO ] Invariant cache hit.
[2023-03-20 11:48:14] [INFO ] Dead Transitions using invariants and state equation in 4096 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9512 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Treatment of property ServersAndClients-PT-100320-LTLFireability-01 finished in 133159 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 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31581 transitions
Trivial Post-agglo rules discarded 31581 transitions
Performed 31581 trivial Post agglomeration. Transition count delta: 31581
Iterating post reduction 0 with 31581 rules applied. Total rules applied 31581 place count 32721 transition count 32619
Reduce places removed 31581 places and 0 transitions.
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Iterating post reduction 1 with 31900 rules applied. Total rules applied 63481 place count 1140 transition count 32300
Reduce places removed 638 places and 0 transitions.
Ensure Unique test removed 31800 transitions
Reduce isomorphic transitions removed 31800 transitions.
Iterating post reduction 2 with 32438 rules applied. Total rules applied 95919 place count 502 transition count 500
Applied a total of 95919 rules in 1235 ms. Remains 502 /32721 variables (removed 32219) and now considering 500/64200 (removed 63700) transitions.
// Phase 1: matrix 500 rows 502 cols
[2023-03-20 11:48:19] [INFO ] Computed 202 place invariants in 5 ms
[2023-03-20 11:48:20] [INFO ] Implicit Places using invariants in 755 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 762 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/32721 places, 500/64200 transitions.
Graph (trivial) has 298 edges and 302 vertex of which 199 / 302 are part of one of the 1 SCC in 3 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 20 ms. Remains 4 /302 variables (removed 298) and now considering 6/500 (removed 494) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-20 11:48:20] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 11:48:20] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-20 11:48:20] [INFO ] Invariant cache hit.
[2023-03-20 11:48:20] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/32721 places, 6/64200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2060 ms. Remains : 4/32721 places, 6/64200 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-02 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-100320-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-02 finished in 2263 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 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31580 transitions
Trivial Post-agglo rules discarded 31580 transitions
Performed 31580 trivial Post agglomeration. Transition count delta: 31580
Iterating post reduction 0 with 31580 rules applied. Total rules applied 31580 place count 32721 transition count 32620
Reduce places removed 31580 places and 0 transitions.
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Iterating post reduction 1 with 31899 rules applied. Total rules applied 63479 place count 1141 transition count 32301
Reduce places removed 637 places and 0 transitions.
Ensure Unique test removed 31700 transitions
Reduce isomorphic transitions removed 31700 transitions.
Iterating post reduction 2 with 32337 rules applied. Total rules applied 95816 place count 504 transition count 601
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 95915 place count 504 transition count 502
Applied a total of 95915 rules in 1086 ms. Remains 504 /32721 variables (removed 32217) and now considering 502/64200 (removed 63698) transitions.
// Phase 1: matrix 502 rows 504 cols
[2023-03-20 11:48:21] [INFO ] Computed 203 place invariants in 5 ms
[2023-03-20 11:48:22] [INFO ] Implicit Places using invariants in 819 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 827 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 303/32721 places, 502/64200 transitions.
Graph (trivial) has 298 edges and 303 vertex of which 199 / 303 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 7 transition count 108
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 7 transition count 108
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 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 5 transition count 8
Applied a total of 299 rules in 8 ms. Remains 5 /303 variables (removed 298) and now considering 8/502 (removed 494) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-20 11:48:22] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 11:48:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-20 11:48:22] [INFO ] Invariant cache hit.
[2023-03-20 11:48:22] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/32721 places, 8/64200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1973 ms. Remains : 5/32721 places, 8/64200 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-03 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 s2 1) (OR (LT s0 1) (LT s3 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-100320-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-03 finished in 2055 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((G(p0)||F(!(!p0 U p1))))))'
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 841 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2023-03-20 11:48:24] [INFO ] Computed 521 place invariants in 897 ms
[2023-03-20 11:48:29] [INFO ] Implicit Places using invariants in 5766 ms returned []
Implicit Place search using SMT only with invariants took 5771 ms to find 0 implicit places.
[2023-03-20 11:48:29] [INFO ] Invariant cache hit.
[2023-03-20 11:48:33] [INFO ] Dead Transitions using invariants and state equation in 3923 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10544 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s20951 1), p1:(AND (GEQ s325 1) (GEQ s18076 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 9370 ms.
Product exploration explored 100000 steps with 0 reset in 8638 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Finished random walk after 4212 steps, including 1 resets, run visited all 3 properties in 497 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 363 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 552 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 11:48:54] [INFO ] Invariant cache hit.
[2023-03-20 11:48:58] [INFO ] Implicit Places using invariants in 4299 ms returned []
Implicit Place search using SMT only with invariants took 4301 ms to find 0 implicit places.
[2023-03-20 11:48:58] [INFO ] Invariant cache hit.
[2023-03-20 11:49:02] [INFO ] Dead Transitions using invariants and state equation in 4124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8998 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1220 ms. (steps per millisecond=8 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 11:49:04] [INFO ] Invariant cache hit.
[2023-03-20 11:49:18] [INFO ] [Real]Absence check using 421 positive place invariants in 5905 ms returned sat
[2023-03-20 11:49:19] [INFO ] [Real]Absence check using 421 positive and 100 generalized place invariants in 746 ms returned sat
[2023-03-20 11:49:30] [INFO ] After 8887ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 11:49:30] [INFO ] After 8976ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-20 11:49:30] [INFO ] After 25153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31580 transitions
Trivial Post-agglo rules discarded 31580 transitions
Performed 31580 trivial Post agglomeration. Transition count delta: 31580
Iterating post reduction 0 with 31580 rules applied. Total rules applied 31580 place count 32721 transition count 32620
Reduce places removed 31580 places and 0 transitions.
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Iterating post reduction 1 with 31899 rules applied. Total rules applied 63479 place count 1141 transition count 32301
Reduce places removed 637 places and 0 transitions.
Ensure Unique test removed 31700 transitions
Reduce isomorphic transitions removed 31700 transitions.
Iterating post reduction 2 with 32337 rules applied. Total rules applied 95816 place count 504 transition count 601
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 95915 place count 504 transition count 502
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 96014 place count 504 transition count 502
Applied a total of 96014 rules in 1307 ms. Remains 504 /32721 variables (removed 32217) and now considering 502/64200 (removed 63698) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1307 ms. Remains : 504/32721 places, 502/64200 transitions.
Finished random walk after 836 steps, including 0 resets, run visited all 2 properties in 21 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 413 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 0 reset in 8861 ms.
Product exploration explored 100000 steps with 0 reset in 9024 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Performed 28304 Post agglomeration using F-continuation condition.
Performed 31899 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31899 rules applied. Total rules applied 31899 place count 32721 transition count 64200
Discarding 317 places :
Symmetric choice reduction at 1 with 317 rule applications. Total rules 32216 place count 32404 transition count 32500
Deduced a syphon composed of 31899 places in 9 ms
Iterating global reduction 1 with 317 rules applied. Total rules applied 32533 place count 32404 transition count 32500
Deduced a syphon composed of 31899 places in 12 ms
Applied a total of 32533 rules in 34255 ms. Remains 32404 /32721 variables (removed 317) and now considering 32500/64200 (removed 31700) transitions.
[2023-03-20 11:50:24] [INFO ] Flow matrix only has 32401 transitions (discarded 99 similar events)
// Phase 1: matrix 32401 rows 32404 cols
[2023-03-20 11:50:46] [INFO ] Computed 204 place invariants in 21183 ms
[2023-03-20 11:50:50] [INFO ] Dead Transitions using invariants and state equation in 25647 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32404/32721 places, 32500/64200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59911 ms. Remains : 32404/32721 places, 32500/64200 transitions.
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 684 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2023-03-20 11:50:52] [INFO ] Computed 521 place invariants in 1001 ms
[2023-03-20 11:50:56] [INFO ] Implicit Places using invariants in 5488 ms returned []
Implicit Place search using SMT only with invariants took 5493 ms to find 0 implicit places.
[2023-03-20 11:50:56] [INFO ] Invariant cache hit.
[2023-03-20 11:51:01] [INFO ] Dead Transitions using invariants and state equation in 4500 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10679 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Treatment of property ServersAndClients-PT-100320-LTLFireability-04 finished in 161172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F((X(p1)&&p2))&&!(!p0 U !p2))))'
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 786 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 11:51:04] [INFO ] Invariant cache hit.
[2023-03-20 11:51:09] [INFO ] Implicit Places using invariants in 4586 ms returned []
Implicit Place search using SMT only with invariants took 4588 ms to find 0 implicit places.
[2023-03-20 11:51:09] [INFO ] Invariant cache hit.
[2023-03-20 11:51:13] [INFO ] Dead Transitions using invariants and state equation in 4645 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10024 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}, { cond=p2, acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(OR (LT s319 1) (LT s17470 1)), p0:(LT s17697 1), p1:(LT s13322 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 24710 steps with 12355 reset in 10003 ms.
Product exploration timeout after 25380 steps with 12690 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))
Knowledge based reduction with 9 factoid took 274 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100320-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100320-LTLFireability-08 finished in 31287 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(X(F(p1)))) U p2) U p0)))'
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 826 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 11:51:35] [INFO ] Invariant cache hit.
[2023-03-20 11:51:40] [INFO ] Implicit Places using invariants in 4364 ms returned []
Implicit Place search using SMT only with invariants took 4372 ms to find 0 implicit places.
[2023-03-20 11:51:40] [INFO ] Invariant cache hit.
[2023-03-20 11:51:44] [INFO ] Dead Transitions using invariants and state equation in 4404 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9621 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p1), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s341 1) (GEQ s26156 1)), p2:(GEQ s25997 1), p1:(GEQ s5471 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 9056 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 7 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-09 finished in 19132 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(F(p0)))))'
Support contains 1 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 677 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 11:51:54] [INFO ] Invariant cache hit.
[2023-03-20 11:51:59] [INFO ] Implicit Places using invariants in 4412 ms returned []
Implicit Place search using SMT only with invariants took 4417 ms to find 0 implicit places.
[2023-03-20 11:51:59] [INFO ] Invariant cache hit.
[2023-03-20 11:52:03] [INFO ] Dead Transitions using invariants and state equation in 4203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9303 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s30177 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]]
Product exploration timeout after 41330 steps with 10332 reset in 10001 ms.
Product exploration timeout after 38880 steps with 9720 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1068 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3391 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3391 steps, saw 1385 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 11:52:28] [INFO ] Invariant cache hit.
[2023-03-20 11:52:40] [INFO ] [Real]Absence check using 421 positive place invariants in 4993 ms returned sat
[2023-03-20 11:52:41] [INFO ] [Real]Absence check using 421 positive and 100 generalized place invariants in 815 ms returned sat
[2023-03-20 11:52:53] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 32721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 32721 transition count 32201
Reduce places removed 32318 places and 0 transitions.
Ensure Unique test removed 31800 transitions
Reduce isomorphic transitions removed 31800 transitions.
Iterating post reduction 1 with 64118 rules applied. Total rules applied 96117 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 96216 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 96513 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 3 with 396 rules applied. Total rules applied 96909 place count 7 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 96910 place count 6 transition count 5
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 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 96913 place count 4 transition count 4
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 5 with 2 rules applied. Total rules applied 96915 place count 3 transition count 3
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 96916 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 96917 place count 2 transition count 2
Applied a total of 96917 rules in 780 ms. Remains 2 /32721 variables (removed 32719) and now considering 2/64200 (removed 64198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 780 ms. Remains : 2/32721 places, 2/64200 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 891 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 11:52:56] [INFO ] Invariant cache hit.
[2023-03-20 11:53:00] [INFO ] Implicit Places using invariants in 4278 ms returned []
Implicit Place search using SMT only with invariants took 4300 ms to find 0 implicit places.
[2023-03-20 11:53:00] [INFO ] Invariant cache hit.
[2023-03-20 11:53:04] [INFO ] Dead Transitions using invariants and state equation in 4145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9345 ms. Remains : 32721/32721 places, 64200/64200 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1091 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3851 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3851 steps, saw 1385 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 11:53:09] [INFO ] Invariant cache hit.
[2023-03-20 11:53:20] [INFO ] [Real]Absence check using 421 positive place invariants in 4628 ms returned sat
[2023-03-20 11:53:21] [INFO ] [Real]Absence check using 421 positive and 100 generalized place invariants in 652 ms returned sat
[2023-03-20 11:53:34] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 32721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 32721 transition count 32201
Reduce places removed 32318 places and 0 transitions.
Ensure Unique test removed 31800 transitions
Reduce isomorphic transitions removed 31800 transitions.
Iterating post reduction 1 with 64118 rules applied. Total rules applied 96117 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 96216 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 96513 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 3 with 396 rules applied. Total rules applied 96909 place count 7 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 96910 place count 6 transition count 5
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 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 96913 place count 4 transition count 4
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 5 with 2 rules applied. Total rules applied 96915 place count 3 transition count 3
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 96916 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 96917 place count 2 transition count 2
Applied a total of 96917 rules in 1004 ms. Remains 2 /32721 variables (removed 32719) and now considering 2/64200 (removed 64198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1004 ms. Remains : 2/32721 places, 2/64200 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 40090 steps with 10022 reset in 10003 ms.
Product exploration timeout after 38470 steps with 9617 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Performed 31840 Post agglomeration using F-continuation condition.
Performed 31999 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 32721 transition count 64200
Discarding 318 places :
Symmetric choice reduction at 1 with 318 rule applications. Total rules 32317 place count 32403 transition count 32400
Deduced a syphon composed of 31999 places in 12 ms
Iterating global reduction 1 with 318 rules applied. Total rules applied 32635 place count 32403 transition count 32400
Deduced a syphon composed of 31999 places in 12 ms
Applied a total of 32635 rules in 31308 ms. Remains 32403 /32721 variables (removed 318) and now considering 32400/64200 (removed 31800) transitions.
[2023-03-20 11:54:28] [INFO ] Flow matrix only has 32301 transitions (discarded 99 similar events)
// Phase 1: matrix 32301 rows 32403 cols
[2023-03-20 11:54:49] [INFO ] Computed 203 place invariants in 21563 ms
[2023-03-20 11:54:54] [INFO ] Dead Transitions using invariants and state equation in 26055 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32403/32721 places, 32400/64200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57373 ms. Remains : 32403/32721 places, 32400/64200 transitions.
Support contains 1 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 864 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2023-03-20 11:54:55] [INFO ] Computed 521 place invariants in 738 ms
[2023-03-20 11:55:00] [INFO ] Implicit Places using invariants in 5000 ms returned []
Implicit Place search using SMT only with invariants took 5001 ms to find 0 implicit places.
[2023-03-20 11:55:00] [INFO ] Invariant cache hit.
[2023-03-20 11:55:04] [INFO ] Dead Transitions using invariants and state equation in 4189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10063 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Treatment of property ServersAndClients-PT-100320-LTLFireability-10 finished in 192756 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 U G(p1))&&X((G(F(p0)) U p2))))))'
Support contains 5 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31163 transitions
Trivial Post-agglo rules discarded 31163 transitions
Performed 31163 trivial Post agglomeration. Transition count delta: 31163
Iterating post reduction 0 with 31163 rules applied. Total rules applied 31163 place count 32721 transition count 33037
Reduce places removed 31163 places and 0 transitions.
Performed 636 Post agglomeration using F-continuation condition.Transition count delta: 636
Iterating post reduction 1 with 31799 rules applied. Total rules applied 62962 place count 1558 transition count 32401
Reduce places removed 953 places and 0 transitions.
Ensure Unique test removed 31600 transitions
Reduce isomorphic transitions removed 31600 transitions.
Iterating post reduction 2 with 32553 rules applied. Total rules applied 95515 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 95614 place count 605 transition count 702
Applied a total of 95614 rules in 1283 ms. Remains 605 /32721 variables (removed 32116) and now considering 702/64200 (removed 63498) transitions.
// Phase 1: matrix 702 rows 605 cols
[2023-03-20 11:55:08] [INFO ] Computed 204 place invariants in 3 ms
[2023-03-20 11:55:08] [INFO ] Implicit Places using invariants in 730 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, 502]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 736 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/32721 places, 702/64200 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 13 ms. Remains 8 /404 variables (removed 396) and now considering 15/702 (removed 687) transitions.
// Phase 1: matrix 15 rows 8 cols
[2023-03-20 11:55:08] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-20 11:55:09] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 11:55:09] [INFO ] Invariant cache hit.
[2023-03-20 11:55:09] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/32721 places, 15/64200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2095 ms. Remains : 8/32721 places, 15/64200 transitions.
Stuttering acceptance computed with spot in 825 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=p0, acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(OR p1 p0), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 12}, { cond=(AND p1 p0), acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=11 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=11 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=12 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=12 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=12 dest: 11}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=13 dest: 12}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=13 dest: 13}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s6 1)), p0:(GEQ s5 1), p2:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-11 finished in 3002 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 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 32721 transition count 32201
Reduce places removed 32318 places and 0 transitions.
Ensure Unique test removed 31800 transitions
Reduce isomorphic transitions removed 31800 transitions.
Iterating post reduction 1 with 64118 rules applied. Total rules applied 96117 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 96216 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 96513 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 96908 place count 7 transition count 6
Applied a total of 96908 rules in 881 ms. Remains 7 /32721 variables (removed 32714) and now considering 6/64200 (removed 64194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-20 11:55:10] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 11:55:10] [INFO ] Implicit Places using invariants in 32 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/32721 places, 6/64200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 1 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 2 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-20 11:55:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 11:55:10] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-20 11:55:10] [INFO ] Invariant cache hit.
[2023-03-20 11:55:10] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/32721 places, 3/64200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 965 ms. Remains : 2/32721 places, 3/64200 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-12 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-100320-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-12 finished in 1059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U p1))'
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 687 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2023-03-20 11:55:12] [INFO ] Computed 521 place invariants in 898 ms
[2023-03-20 11:55:16] [INFO ] Implicit Places using invariants in 4675 ms returned []
Implicit Place search using SMT only with invariants took 4679 ms to find 0 implicit places.
[2023-03-20 11:55:16] [INFO ] Invariant cache hit.
[2023-03-20 11:55:20] [INFO ] Dead Transitions using invariants and state equation in 3871 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9260 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s203 1) (GEQ s20803 1)), p1:(AND (GEQ s385 1) (GEQ s22318 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 5 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-13 finished in 9584 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((X(p1)&&p0))))'
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 633 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 11:55:21] [INFO ] Invariant cache hit.
[2023-03-20 11:55:25] [INFO ] Implicit Places using invariants in 4340 ms returned []
Implicit Place search using SMT only with invariants took 4341 ms to find 0 implicit places.
[2023-03-20 11:55:25] [INFO ] Invariant cache hit.
[2023-03-20 11:55:29] [INFO ] Dead Transitions using invariants and state equation in 4027 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9005 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s329 1) (GEQ s18278 1)), p1:(GEQ s17967 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8205 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 5 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-14 finished in 17471 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))||G(p1)))'
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31580 transitions
Trivial Post-agglo rules discarded 31580 transitions
Performed 31580 trivial Post agglomeration. Transition count delta: 31580
Iterating post reduction 0 with 31580 rules applied. Total rules applied 31580 place count 32721 transition count 32620
Reduce places removed 31580 places and 0 transitions.
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Iterating post reduction 1 with 31899 rules applied. Total rules applied 63479 place count 1141 transition count 32301
Reduce places removed 637 places and 0 transitions.
Ensure Unique test removed 31700 transitions
Reduce isomorphic transitions removed 31700 transitions.
Iterating post reduction 2 with 32337 rules applied. Total rules applied 95816 place count 504 transition count 601
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 95915 place count 504 transition count 502
Applied a total of 95915 rules in 977 ms. Remains 504 /32721 variables (removed 32217) and now considering 502/64200 (removed 63698) transitions.
// Phase 1: matrix 502 rows 504 cols
[2023-03-20 11:55:38] [INFO ] Computed 203 place invariants in 2 ms
[2023-03-20 11:55:39] [INFO ] Implicit Places using invariants in 559 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 562 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 303/32721 places, 502/64200 transitions.
Graph (trivial) has 298 edges and 303 vertex of which 199 / 303 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 7 transition count 108
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 7 transition count 108
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 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 5 transition count 8
Applied a total of 299 rules in 4 ms. Remains 5 /303 variables (removed 298) and now considering 8/502 (removed 494) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-20 11:55:39] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 11:55:39] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 11:55:39] [INFO ] Invariant cache hit.
[2023-03-20 11:55:39] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/32721 places, 8/64200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1585 ms. Remains : 5/32721 places, 8/64200 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s2 1) (GEQ s0 1) (GEQ s3 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-15 finished in 1709 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(F(p0)))))'
Found a Shortening insensitive property : ServersAndClients-PT-100320-LTLFireability-01
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31164 transitions
Trivial Post-agglo rules discarded 31164 transitions
Performed 31164 trivial Post agglomeration. Transition count delta: 31164
Iterating post reduction 0 with 31164 rules applied. Total rules applied 31164 place count 32721 transition count 33036
Reduce places removed 31164 places and 0 transitions.
Performed 636 Post agglomeration using F-continuation condition.Transition count delta: 636
Iterating post reduction 1 with 31800 rules applied. Total rules applied 62964 place count 1557 transition count 32400
Reduce places removed 954 places and 0 transitions.
Ensure Unique test removed 31700 transitions
Reduce isomorphic transitions removed 31700 transitions.
Iterating post reduction 2 with 32654 rules applied. Total rules applied 95618 place count 603 transition count 700
Applied a total of 95618 rules in 1354 ms. Remains 603 /32721 variables (removed 32118) and now considering 700/64200 (removed 63500) transitions.
// Phase 1: matrix 700 rows 603 cols
[2023-03-20 11:55:41] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-20 11:55:42] [INFO ] Implicit Places using invariants in 650 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 664 ms to find 200 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 403/32721 places, 700/64200 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 8 ms. Remains 7 /403 variables (removed 396) and now considering 13/700 (removed 687) transitions.
// Phase 1: matrix 13 rows 7 cols
[2023-03-20 11:55:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-20 11:55:42] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 11:55:42] [INFO ] Invariant cache hit.
[2023-03-20 11:55:42] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 7/32721 places, 13/64200 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2078 ms. Remains : 7/32721 places, 13/64200 transitions.
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (AND (OR (LT s0 1) (LT s5 1)) (OR (LT s1 1) (LT s3 1))) (AND (GEQ s1 1) (GEQ s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24307 reset in 314 ms.
Product exploration explored 100000 steps with 24296 reset in 185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-20 11:55:43] [INFO ] Invariant cache hit.
[2023-03-20 11:55:43] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-20 11:55:43] [INFO ] Invariant cache hit.
[2023-03-20 11:55:43] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-20 11:55:43] [INFO ] Invariant cache hit.
[2023-03-20 11:55:43] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 7/7 places, 13/13 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24290 reset in 222 ms.
Product exploration explored 100000 steps with 24276 reset in 238 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-20 11:55:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:55:45] [INFO ] Invariant cache hit.
[2023-03-20 11:55:45] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49 ms. Remains : 7/7 places, 13/13 transitions.
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-20 11:55:45] [INFO ] Invariant cache hit.
[2023-03-20 11:55:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 11:55:45] [INFO ] Invariant cache hit.
[2023-03-20 11:55:45] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-20 11:55:45] [INFO ] Invariant cache hit.
[2023-03-20 11:55:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 7/7 places, 13/13 transitions.
Treatment of property ServersAndClients-PT-100320-LTLFireability-01 finished in 7437 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((G(p0)||F(!(!p0 U p1))))))'
Found a Lengthening insensitive property : ServersAndClients-PT-100320-LTLFireability-04
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31580 transitions
Trivial Post-agglo rules discarded 31580 transitions
Performed 31580 trivial Post agglomeration. Transition count delta: 31580
Iterating post reduction 0 with 31580 rules applied. Total rules applied 31580 place count 32721 transition count 32620
Reduce places removed 31580 places and 0 transitions.
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Iterating post reduction 1 with 31899 rules applied. Total rules applied 63479 place count 1141 transition count 32301
Reduce places removed 637 places and 0 transitions.
Ensure Unique test removed 31700 transitions
Reduce isomorphic transitions removed 31700 transitions.
Iterating post reduction 2 with 32337 rules applied. Total rules applied 95816 place count 504 transition count 601
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 95915 place count 504 transition count 502
Applied a total of 95915 rules in 1062 ms. Remains 504 /32721 variables (removed 32217) and now considering 502/64200 (removed 63698) transitions.
// Phase 1: matrix 502 rows 504 cols
[2023-03-20 11:55:48] [INFO ] Computed 203 place invariants in 2 ms
[2023-03-20 11:55:49] [INFO ] Implicit Places using invariants in 857 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, 502]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 862 ms to find 201 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 303/32721 places, 502/64200 transitions.
Graph (trivial) has 298 edges and 303 vertex of which 199 / 303 are part of one of the 1 SCC in 1 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 7 transition count 108
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 7 transition count 108
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 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 5 transition count 8
Applied a total of 299 rules in 10 ms. Remains 5 /303 variables (removed 298) and now considering 8/502 (removed 494) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-20 11:55:49] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 11:55:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 11:55:49] [INFO ] Invariant cache hit.
[2023-03-20 11:55:49] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 5/32721 places, 8/64200 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1975 ms. Remains : 5/32721 places, 8/64200 transitions.
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s4 1), p1:(AND (GEQ s0 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6089 reset in 71 ms.
Product exploration explored 100000 steps with 6181 reset in 170 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 278 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 374 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-20 11:55:50] [INFO ] Invariant cache hit.
[2023-03-20 11:55:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 11:55:50] [INFO ] Invariant cache hit.
[2023-03-20 11:55:50] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-20 11:55:50] [INFO ] Invariant cache hit.
[2023-03-20 11:55:50] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 5/5 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 272 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 380 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 6246 reset in 111 ms.
Product exploration explored 100000 steps with 6204 reset in 125 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-20 11:55:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:55:52] [INFO ] Invariant cache hit.
[2023-03-20 11:55:52] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30 ms. Remains : 5/5 places, 8/8 transitions.
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-20 11:55:52] [INFO ] Invariant cache hit.
[2023-03-20 11:55:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-20 11:55:52] [INFO ] Invariant cache hit.
[2023-03-20 11:55:52] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-20 11:55:52] [INFO ] Invariant cache hit.
[2023-03-20 11:55:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 5/5 places, 8/8 transitions.
Treatment of property ServersAndClients-PT-100320-LTLFireability-04 finished in 7914 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(F(p0)))))'
Found a Shortening insensitive property : ServersAndClients-PT-100320-LTLFireability-10
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 32721 transition count 32201
Reduce places removed 32318 places and 0 transitions.
Ensure Unique test removed 31800 transitions
Reduce isomorphic transitions removed 31800 transitions.
Iterating post reduction 1 with 64118 rules applied. Total rules applied 96117 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 96216 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 96513 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 96908 place count 7 transition count 6
Applied a total of 96908 rules in 1191 ms. Remains 7 /32721 variables (removed 32714) and now considering 6/64200 (removed 64194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-20 11:55:56] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 11:55:56] [INFO ] Implicit Places using invariants in 29 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/32721 places, 6/64200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-20 11:55:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 11:55:56] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 11:55:56] [INFO ] Invariant cache hit.
[2023-03-20 11:55:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2/32721 places, 3/64200 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1262 ms. Remains : 2/32721 places, 3/64200 transitions.
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22856 reset in 45 ms.
Product exploration explored 100000 steps with 22880 reset in 51 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-20 11:55:57] [INFO ] Invariant cache hit.
[2023-03-20 11:55:57] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-20 11:55:57] [INFO ] Invariant cache hit.
[2023-03-20 11:55: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.
[2023-03-20 11:55:57] [INFO ] Invariant cache hit.
[2023-03-20 11:55:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 2/2 places, 3/3 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22867 reset in 44 ms.
Product exploration explored 100000 steps with 22839 reset in 118 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-20 11:55:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:55:58] [INFO ] Invariant cache hit.
[2023-03-20 11:55:58] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32 ms. Remains : 2/2 places, 3/3 transitions.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-20 11:55:58] [INFO ] Invariant cache hit.
[2023-03-20 11:55:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 11:55:58] [INFO ] Invariant cache hit.
[2023-03-20 11:55:58] [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.
[2023-03-20 11:55:58] [INFO ] Invariant cache hit.
[2023-03-20 11:55:58] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 2/2 places, 3/3 transitions.
Treatment of property ServersAndClients-PT-100320-LTLFireability-10 finished in 6161 ms.
[2023-03-20 11:56:03] [INFO ] Flatten gal took : 2496 ms
[2023-03-20 11:56:03] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 11:56:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32721 places, 64200 transitions and 192800 arcs took 223 ms.
Total runtime 652612 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2166/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2166/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2166/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ServersAndClients-PT-100320-LTLFireability-01
Could not compute solution for formula : ServersAndClients-PT-100320-LTLFireability-04
Could not compute solution for formula : ServersAndClients-PT-100320-LTLFireability-10

BK_STOP 1679314160131

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ServersAndClients-PT-100320-LTLFireability-01
ltl formula formula --ltl=/tmp/2166/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32721 places, 64200 transitions and 192800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2166/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 14.420 real 2.740 user 4.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2166/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2166/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2166/ltl_0_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ServersAndClients-PT-100320-LTLFireability-04
ltl formula formula --ltl=/tmp/2166/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32721 places, 64200 transitions and 192800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2166/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2166/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 9.120 real 2.790 user 3.690 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2166/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2166/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ServersAndClients-PT-100320-LTLFireability-10
ltl formula formula --ltl=/tmp/2166/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32721 places, 64200 transitions and 192800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 12.760 real 2.500 user 3.660 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2166/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2166/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2166/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2166/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ServersAndClients-PT-100320, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r361-smll-167891811600492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-100320.tgz
mv ServersAndClients-PT-100320 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;