fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r357-smll-167891806500492
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ServersAndClients-PT-100320

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16213.968 1463571.00 2151116.00 20830.90 FTFF?FTFTFTFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
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 1679274210749

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100320
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-20 01:03:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 01:03:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:03:35] [INFO ] Load time of PNML (sax parser for PT used): 1468 ms
[2023-03-20 01:03:35] [INFO ] Transformed 32721 places.
[2023-03-20 01:03:35] [INFO ] Transformed 64200 transitions.
[2023-03-20 01:03:35] [INFO ] Parsed PT model containing 32721 places and 64200 transitions and 192800 arcs in 1857 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 57 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 636 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 01:03:38] [INFO ] Computed 521 place invariants in 1410 ms
[2023-03-20 01:03:44] [INFO ] Implicit Places using invariants in 6812 ms returned []
Implicit Place search using SMT only with invariants took 6855 ms to find 0 implicit places.
[2023-03-20 01:03:44] [INFO ] Invariant cache hit.
[2023-03-20 01:03:48] [INFO ] Dead Transitions using invariants and state equation in 4618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12124 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Support contains 46 out of 32721 places after structural reductions.
[2023-03-20 01:03:52] [INFO ] Flatten gal took : 2428 ms
[2023-03-20 01:03:53] [INFO ] Flatten gal took : 1729 ms
[2023-03-20 01:03:57] [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 1510 ms. (steps per millisecond=6 ) properties (out of 27) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-20 01:04:01] [INFO ] Invariant cache hit.
[2023-03-20 01:04:23] [INFO ] [Real]Absence check using 421 positive place invariants in 5953 ms returned sat
[2023-03-20 01:04:24] [INFO ] [Real]Absence check using 421 positive and 100 generalized place invariants in 726 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:04:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:04:26] [INFO ] After 25240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 32721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31992 transitions
Trivial Post-agglo rules discarded 31992 transitions
Performed 31992 trivial Post agglomeration. Transition count delta: 31992
Iterating post reduction 0 with 31992 rules applied. Total rules applied 31992 place count 32721 transition count 32208
Reduce places removed 32304 places and 0 transitions.
Ensure Unique test removed 31100 transitions
Reduce isomorphic transitions removed 31100 transitions.
Iterating post reduction 1 with 63404 rules applied. Total rules applied 95396 place count 417 transition count 1108
Drop transitions removed 792 transitions
Redundant transition composition rules discarded 792 transitions
Iterating global reduction 2 with 792 rules applied. Total rules applied 96188 place count 417 transition count 316
Discarding 92 places :
Implicit places reduction removed 92 places
Drop transitions removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 2 with 276 rules applied. Total rules applied 96464 place count 325 transition count 132
Reduce places removed 276 places and 0 transitions.
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 3 with 368 rules applied. Total rules applied 96832 place count 49 transition count 40
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 96840 place count 49 transition count 40
Applied a total of 96840 rules in 1357 ms. Remains 49 /32721 variables (removed 32672) and now considering 40/64200 (removed 64160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1357 ms. Remains : 49/32721 places, 40/64200 transitions.
Finished random walk after 96 steps, including 0 resets, run visited all 8 properties in 3 ms. (steps per millisecond=32 )
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 997 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 01:04:29] [INFO ] Invariant cache hit.
[2023-03-20 01:04:33] [INFO ] Implicit Places using invariants in 4120 ms returned []
Implicit Place search using SMT only with invariants took 4121 ms to find 0 implicit places.
[2023-03-20 01:04:33] [INFO ] Invariant cache hit.
[2023-03-20 01:04:37] [INFO ] Dead Transitions using invariants and state equation in 3937 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9068 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 401 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 45920 steps with 11480 reset in 10001 ms.
Product exploration timeout after 49660 steps with 12415 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 112 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 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 425 steps, including 0 resets, run visited all 1 properties in 59 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 155 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 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 210 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 454 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 01:05:00] [INFO ] Invariant cache hit.
[2023-03-20 01:05:04] [INFO ] Implicit Places using invariants in 4121 ms returned []
Implicit Place search using SMT only with invariants took 4125 ms to find 0 implicit places.
[2023-03-20 01:05:04] [INFO ] Invariant cache hit.
[2023-03-20 01:05:08] [INFO ] Dead Transitions using invariants and state equation in 3981 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8566 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 85 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 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 285 steps, including 0 resets, run visited all 1 properties in 46 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 158 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)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 44340 steps with 11085 reset in 10002 ms.
Product exploration timeout after 46930 steps with 11732 reset in 10002 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 148 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 30773 Post agglomeration using F-continuation condition.
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 9 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 22 ms
Applied a total of 32434 rules in 32087 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 01:06:23] [INFO ] Computed 204 place invariants in 21026 ms
[2023-03-20 01:06:28] [INFO ] Dead Transitions using invariants and state equation in 25303 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 57396 ms. Remains : 32404/32721 places, 32500/64200 transitions.
Built C files in :
/tmp/ltsmin7102680427164882809
[2023-03-20 01:06:29] [INFO ] Built C files in 997ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7102680427164882809
Running compilation step : cd /tmp/ltsmin7102680427164882809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7102680427164882809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7102680427164882809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 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 405 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 01:06:33] [INFO ] Computed 521 place invariants in 687 ms
[2023-03-20 01:06:37] [INFO ] Implicit Places using invariants in 4627 ms returned []
Implicit Place search using SMT only with invariants took 4629 ms to find 0 implicit places.
[2023-03-20 01:06:37] [INFO ] Invariant cache hit.
[2023-03-20 01:06:41] [INFO ] Dead Transitions using invariants and state equation in 4060 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9101 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Built C files in :
/tmp/ltsmin3450411145510678416
[2023-03-20 01:06:42] [INFO ] Built C files in 656ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3450411145510678416
Running compilation step : cd /tmp/ltsmin3450411145510678416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3450411145510678416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3450411145510678416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-20 01:06:48] [INFO ] Flatten gal took : 1870 ms
[2023-03-20 01:06:50] [INFO ] Flatten gal took : 1690 ms
[2023-03-20 01:06:51] [INFO ] Time to serialize gal into /tmp/LTL3000223650091893927.gal : 333 ms
[2023-03-20 01:06:51] [INFO ] Time to serialize properties into /tmp/LTL4054802218585745412.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3000223650091893927.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8555181887144837458.hoa' '-atoms' '/tmp/LTL4054802218585745412.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Detected timeout of ITS tools.
[2023-03-20 01:07:09] [INFO ] Flatten gal took : 2030 ms
[2023-03-20 01:07:11] [INFO ] Flatten gal took : 1722 ms
[2023-03-20 01:07:11] [INFO ] Time to serialize gal into /tmp/LTL10491908998792822359.gal : 241 ms
[2023-03-20 01:07:11] [INFO ] Time to serialize properties into /tmp/LTL16471886529222279141.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10491908998792822359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16471886529222279141.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-20 01:07:28] [INFO ] Flatten gal took : 2013 ms
[2023-03-20 01:07:28] [INFO ] Applying decomposition
[2023-03-20 01:07:30] [INFO ] Flatten gal took : 1682 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14293474826267958618.txt' '-o' '/tmp/graph14293474826267958618.bin' '-w' '/tmp/graph14293474826267958618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14293474826267958618.bin' '-l' '-1' '-v' '-w' '/tmp/graph14293474826267958618.weights' '-q' '0' '-e' '0.001'
[2023-03-20 01:07:34] [INFO ] Decomposing Gal with order
[2023-03-20 01:07:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 01:08:01] [INFO ] Removed a total of 63897 redundant transitions.
[2023-03-20 01:08:03] [INFO ] Flatten gal took : 12357 ms
[2023-03-20 01:08:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 362 ms.
[2023-03-20 01:08:05] [INFO ] Time to serialize gal into /tmp/LTL11646400840417876885.gal : 508 ms
[2023-03-20 01:08:05] [INFO ] Time to serialize properties into /tmp/LTL4455783054702994343.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11646400840417876885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4455783054702994343.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8616655998907732099
[2023-03-20 01:08:21] [INFO ] Built C files in 527ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8616655998907732099
Running compilation step : cd /tmp/ltsmin8616655998907732099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8616655998907732099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8616655998907732099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ServersAndClients-PT-100320-LTLFireability-01 finished in 235530 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 1121 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 01:08:25] [INFO ] Computed 202 place invariants in 3 ms
[2023-03-20 01:08:25] [INFO ] Implicit Places using invariants in 522 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 526 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 11 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 01:08:25] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 01:08:26] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-20 01:08:26] [INFO ] Invariant cache hit.
[2023-03-20 01:08:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 73 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 1732 ms. Remains : 4/32721 places, 6/64200 transitions.
Stuttering acceptance computed with spot in 37 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 1902 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 1021 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 01:08:27] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-20 01:08:27] [INFO ] Implicit Places using invariants in 727 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 728 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 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 5 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 01:08:27] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 01:08:27] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-20 01:08:27] [INFO ] Invariant cache hit.
[2023-03-20 01:08:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 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 1791 ms. Remains : 5/32721 places, 8/64200 transitions.
Stuttering acceptance computed with spot in 33 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 1 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-03 finished in 1856 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 393 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 01:08:29] [INFO ] Computed 521 place invariants in 902 ms
[2023-03-20 01:08:33] [INFO ] Implicit Places using invariants in 4785 ms returned []
Implicit Place search using SMT only with invariants took 4786 ms to find 0 implicit places.
[2023-03-20 01:08:33] [INFO ] Invariant cache hit.
[2023-03-20 01:08:37] [INFO ] Dead Transitions using invariants and state equation in 4124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9317 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 123 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 1 reset in 8216 ms.
Product exploration explored 100000 steps with 0 reset in 8547 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 239 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 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1189 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 92 ms. (steps per millisecond=108 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:08:56] [INFO ] Invariant cache hit.
[2023-03-20 01:09:08] [INFO ] [Real]Absence check using 421 positive place invariants in 4757 ms returned sat
[2023-03-20 01:09:09] [INFO ] [Real]Absence check using 421 positive and 100 generalized place invariants in 720 ms returned sat
[2023-03-20 01:09:21] [INFO ] After 9998ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 01:09:21] [INFO ] After 10075ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 01:09:21] [INFO ] After 25133ms 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 1319 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 1320 ms. Remains : 504/32721 places, 502/64200 transitions.
Finished random walk after 2862 steps, including 0 resets, run visited all 2 properties in 94 ms. (steps per millisecond=30 )
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 332 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 112 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 207 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 652 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 01:09:24] [INFO ] Invariant cache hit.
[2023-03-20 01:09:28] [INFO ] Implicit Places using invariants in 4397 ms returned []
Implicit Place search using SMT only with invariants took 4400 ms to find 0 implicit places.
[2023-03-20 01:09:28] [INFO ] Invariant cache hit.
[2023-03-20 01:09:32] [INFO ] Dead Transitions using invariants and state equation in 3918 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8979 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 245 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 121 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1506 ms. (steps per millisecond=6 ) properties (out of 3) 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 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:09:35] [INFO ] Invariant cache hit.
[2023-03-20 01:09:48] [INFO ] [Real]Absence check using 421 positive place invariants in 4820 ms returned sat
[2023-03-20 01:09:48] [INFO ] [Real]Absence check using 421 positive and 100 generalized place invariants in 843 ms returned sat
[2023-03-20 01:10:00] [INFO ] After 9404ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 01:10:00] [INFO ] After 9433ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-20 01:10:00] [INFO ] After 25072ms 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 1329 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 1329 ms. Remains : 504/32721 places, 502/64200 transitions.
Finished random walk after 503 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=38 )
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 310 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 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 0 reset in 8495 ms.
Product exploration explored 100000 steps with 1 reset in 8575 ms.
Applying partial POR strategy [false, true, true]
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 SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
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 8 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 8 ms
Applied a total of 32533 rules in 30604 ms. Remains 32404 /32721 variables (removed 317) and now considering 32500/64200 (removed 31700) transitions.
[2023-03-20 01:10:50] [INFO ] Flow matrix only has 32401 transitions (discarded 99 similar events)
// Phase 1: matrix 32401 rows 32404 cols
[2023-03-20 01:11:11] [INFO ] Computed 204 place invariants in 20871 ms
[2023-03-20 01:11:15] [INFO ] Dead Transitions using invariants and state equation in 25020 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 55630 ms. Remains : 32404/32721 places, 32500/64200 transitions.
Built C files in :
/tmp/ltsmin10856866922041832538
[2023-03-20 01:11:16] [INFO ] Built C files in 663ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10856866922041832538
Running compilation step : cd /tmp/ltsmin10856866922041832538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10856866922041832538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10856866922041832538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 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 531 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 01:11:20] [INFO ] Computed 521 place invariants in 959 ms
[2023-03-20 01:11:25] [INFO ] Implicit Places using invariants in 5339 ms returned []
Implicit Place search using SMT only with invariants took 5344 ms to find 0 implicit places.
[2023-03-20 01:11:25] [INFO ] Invariant cache hit.
[2023-03-20 01:11:29] [INFO ] Dead Transitions using invariants and state equation in 4038 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9919 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Built C files in :
/tmp/ltsmin5848658469326564832
[2023-03-20 01:11:29] [INFO ] Built C files in 432ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5848658469326564832
Running compilation step : cd /tmp/ltsmin5848658469326564832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5848658469326564832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5848658469326564832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-20 01:11:35] [INFO ] Flatten gal took : 1625 ms
[2023-03-20 01:11:37] [INFO ] Flatten gal took : 1842 ms
[2023-03-20 01:11:37] [INFO ] Time to serialize gal into /tmp/LTL11976980079797887339.gal : 218 ms
[2023-03-20 01:11:37] [INFO ] Time to serialize properties into /tmp/LTL4568048135022913559.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11976980079797887339.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9032401251336637851.hoa' '-atoms' '/tmp/LTL4568048135022913559.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Detected timeout of ITS tools.
[2023-03-20 01:11:55] [INFO ] Flatten gal took : 1723 ms
[2023-03-20 01:11:57] [INFO ] Flatten gal took : 1712 ms
[2023-03-20 01:11:57] [INFO ] Time to serialize gal into /tmp/LTL4074352270256040494.gal : 240 ms
[2023-03-20 01:11:57] [INFO ] Time to serialize properties into /tmp/LTL7633895621751975671.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4074352270256040494.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7633895621751975671.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-20 01:12:14] [INFO ] Flatten gal took : 1922 ms
[2023-03-20 01:12:14] [INFO ] Applying decomposition
[2023-03-20 01:12:16] [INFO ] Flatten gal took : 1617 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1724184102475117707.txt' '-o' '/tmp/graph1724184102475117707.bin' '-w' '/tmp/graph1724184102475117707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1724184102475117707.bin' '-l' '-1' '-v' '-w' '/tmp/graph1724184102475117707.weights' '-q' '0' '-e' '0.001'
[2023-03-20 01:12:20] [INFO ] Decomposing Gal with order
[2023-03-20 01:12:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 01:12:47] [INFO ] Removed a total of 63859 redundant transitions.
[2023-03-20 01:12:48] [INFO ] Flatten gal took : 11102 ms
[2023-03-20 01:12:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 264 ms.
[2023-03-20 01:12:50] [INFO ] Time to serialize gal into /tmp/LTL10978372632023574648.gal : 361 ms
[2023-03-20 01:12:50] [INFO ] Time to serialize properties into /tmp/LTL2269228794364969526.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10978372632023574648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2269228794364969526.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17035482719560120858
[2023-03-20 01:13:05] [INFO ] Built C files in 427ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17035482719560120858
Running compilation step : cd /tmp/ltsmin17035482719560120858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17035482719560120858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17035482719560120858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ServersAndClients-PT-100320-LTLFireability-04 finished in 280774 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 572 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 01:13:09] [INFO ] Invariant cache hit.
[2023-03-20 01:13:13] [INFO ] Implicit Places using invariants in 4017 ms returned []
Implicit Place search using SMT only with invariants took 4020 ms to find 0 implicit places.
[2023-03-20 01:13:13] [INFO ] Invariant cache hit.
[2023-03-20 01:13:17] [INFO ] Dead Transitions using invariants and state equation in 4062 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8657 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 271 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 28890 steps with 14445 reset in 10002 ms.
Product exploration timeout after 29990 steps with 14995 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 : [(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 220 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 29696 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 595 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 01:13:39] [INFO ] Invariant cache hit.
[2023-03-20 01:13:43] [INFO ] Implicit Places using invariants in 4164 ms returned []
Implicit Place search using SMT only with invariants took 4166 ms to find 0 implicit places.
[2023-03-20 01:13:43] [INFO ] Invariant cache hit.
[2023-03-20 01:13:47] [INFO ] Dead Transitions using invariants and state equation in 4107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8870 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 186 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 8365 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-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-09 finished in 17517 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 494 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 01:13:56] [INFO ] Invariant cache hit.
[2023-03-20 01:14:00] [INFO ] Implicit Places using invariants in 3976 ms returned []
Implicit Place search using SMT only with invariants took 3977 ms to find 0 implicit places.
[2023-03-20 01:14:00] [INFO ] Invariant cache hit.
[2023-03-20 01:14:04] [INFO ] Dead Transitions using invariants and state equation in 4132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8605 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 132 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 44950 steps with 11237 reset in 10002 ms.
Product exploration timeout after 47320 steps with 11830 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 80 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)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1002 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 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4682 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4682 steps, saw 1706 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:14:29] [INFO ] Invariant cache hit.
[2023-03-20 01:14:40] [INFO ] [Real]Absence check using 421 positive place invariants in 4504 ms returned sat
[2023-03-20 01:14:41] [INFO ] [Real]Absence check using 421 positive and 100 generalized place invariants in 848 ms returned sat
[2023-03-20 01:14:54] [INFO ] After 25029ms 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 754 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 754 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 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 127 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)]
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 793 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 01:14:56] [INFO ] Invariant cache hit.
[2023-03-20 01:15:00] [INFO ] Implicit Places using invariants in 3963 ms returned []
Implicit Place search using SMT only with invariants took 3964 ms to find 0 implicit places.
[2023-03-20 01:15:00] [INFO ] Invariant cache hit.
[2023-03-20 01:15:04] [INFO ] Dead Transitions using invariants and state equation in 3959 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8723 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 85 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 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 867 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4536 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4536 steps, saw 1706 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:15:09] [INFO ] Invariant cache hit.
[2023-03-20 01:15:20] [INFO ] [Real]Absence check using 421 positive place invariants in 4650 ms returned sat
[2023-03-20 01:15:21] [INFO ] [Real]Absence check using 421 positive and 100 generalized place invariants in 678 ms returned sat
[2023-03-20 01:15:34] [INFO ] After 25029ms 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 949 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 949 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 104 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 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 45590 steps with 11397 reset in 10001 ms.
Product exploration timeout after 47190 steps with 11797 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 140 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 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 8 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 8 ms
Applied a total of 32635 rules in 29761 ms. Remains 32403 /32721 variables (removed 318) and now considering 32400/64200 (removed 31800) transitions.
[2023-03-20 01:16:26] [INFO ] Flow matrix only has 32301 transitions (discarded 99 similar events)
// Phase 1: matrix 32301 rows 32403 cols
[2023-03-20 01:16:47] [INFO ] Computed 203 place invariants in 21359 ms
[2023-03-20 01:16:51] [INFO ] Dead Transitions using invariants and state equation in 25731 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 55499 ms. Remains : 32403/32721 places, 32400/64200 transitions.
Built C files in :
/tmp/ltsmin17767223556154274076
[2023-03-20 01:16:52] [INFO ] Built C files in 431ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17767223556154274076
Running compilation step : cd /tmp/ltsmin17767223556154274076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17767223556154274076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17767223556154274076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 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 560 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 01:16:56] [INFO ] Computed 521 place invariants in 1015 ms
[2023-03-20 01:17:01] [INFO ] Implicit Places using invariants in 5166 ms returned []
Implicit Place search using SMT only with invariants took 5167 ms to find 0 implicit places.
[2023-03-20 01:17:01] [INFO ] Invariant cache hit.
[2023-03-20 01:17:04] [INFO ] Dead Transitions using invariants and state equation in 3872 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9602 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Built C files in :
/tmp/ltsmin13798558266651121608
[2023-03-20 01:17:05] [INFO ] Built C files in 418ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13798558266651121608
Running compilation step : cd /tmp/ltsmin13798558266651121608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13798558266651121608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13798558266651121608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-20 01:17:11] [INFO ] Flatten gal took : 1986 ms
[2023-03-20 01:17:13] [INFO ] Flatten gal took : 1969 ms
[2023-03-20 01:17:13] [INFO ] Time to serialize gal into /tmp/LTL5729969282027409682.gal : 382 ms
[2023-03-20 01:17:13] [INFO ] Time to serialize properties into /tmp/LTL16724716093644030814.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5729969282027409682.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8189691695505269335.hoa' '-atoms' '/tmp/LTL16724716093644030814.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Detected timeout of ITS tools.
[2023-03-20 01:17:32] [INFO ] Flatten gal took : 2313 ms
[2023-03-20 01:17:34] [INFO ] Flatten gal took : 1731 ms
[2023-03-20 01:17:34] [INFO ] Time to serialize gal into /tmp/LTL524921651321289104.gal : 224 ms
[2023-03-20 01:17:34] [INFO ] Time to serialize properties into /tmp/LTL8191581670202539269.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL524921651321289104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8191581670202539269.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-20 01:17:51] [INFO ] Flatten gal took : 2030 ms
[2023-03-20 01:17:51] [INFO ] Applying decomposition
[2023-03-20 01:17:53] [INFO ] Flatten gal took : 1924 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4982101324071802246.txt' '-o' '/tmp/graph4982101324071802246.bin' '-w' '/tmp/graph4982101324071802246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4982101324071802246.bin' '-l' '-1' '-v' '-w' '/tmp/graph4982101324071802246.weights' '-q' '0' '-e' '0.001'
[2023-03-20 01:17:57] [INFO ] Decomposing Gal with order
[2023-03-20 01:18:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 01:18:25] [INFO ] Removed a total of 63879 redundant transitions.
[2023-03-20 01:18:26] [INFO ] Flatten gal took : 11472 ms
[2023-03-20 01:18:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 301 ms.
[2023-03-20 01:18:28] [INFO ] Time to serialize gal into /tmp/LTL13312078593210036705.gal : 420 ms
[2023-03-20 01:18:28] [INFO ] Time to serialize properties into /tmp/LTL3211001253010862827.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13312078593210036705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3211001253010862827.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15731562749092650524
[2023-03-20 01:18:43] [INFO ] Built C files in 632ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15731562749092650524
Running compilation step : cd /tmp/ltsmin15731562749092650524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15731562749092650524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15731562749092650524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ServersAndClients-PT-100320-LTLFireability-10 finished in 290836 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 1109 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 01:18:47] [INFO ] Computed 204 place invariants in 4 ms
[2023-03-20 01:18:48] [INFO ] Implicit Places using invariants in 658 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 663 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 6 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 01:18:48] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-20 01:18:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 01:18:48] [INFO ] Invariant cache hit.
[2023-03-20 01:18:48] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 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 1832 ms. Remains : 8/32721 places, 15/64200 transitions.
Stuttering acceptance computed with spot in 855 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 2761 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 801 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 01:18:50] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 01:18:50] [INFO ] Implicit Places using invariants in 34 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 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 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 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 01:18:50] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 01:18:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-20 01:18:50] [INFO ] Invariant cache hit.
[2023-03-20 01:18:50] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/32721 places, 3/64200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 888 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 979 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 762 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 01:18:52] [INFO ] Computed 521 place invariants in 738 ms
[2023-03-20 01:18:56] [INFO ] Implicit Places using invariants in 5322 ms returned []
Implicit Place search using SMT only with invariants took 5323 ms to find 0 implicit places.
[2023-03-20 01:18:56] [INFO ] Invariant cache hit.
[2023-03-20 01:19:01] [INFO ] Dead Transitions using invariants and state equation in 4467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10561 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 120 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 3 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-13 finished in 10787 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 609 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
[2023-03-20 01:19:01] [INFO ] Invariant cache hit.
[2023-03-20 01:19:06] [INFO ] Implicit Places using invariants in 4647 ms returned []
Implicit Place search using SMT only with invariants took 4649 ms to find 0 implicit places.
[2023-03-20 01:19:06] [INFO ] Invariant cache hit.
[2023-03-20 01:19:11] [INFO ] Dead Transitions using invariants and state equation in 4515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9778 ms. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 125 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 9253 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 19273 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 948 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 01:19:21] [INFO ] Computed 203 place invariants in 2 ms
[2023-03-20 01:19:22] [INFO ] Implicit Places using invariants in 554 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 555 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 01:19:22] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 01:19:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 01:19:22] [INFO ] Invariant cache hit.
[2023-03-20 01:19:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 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 1546 ms. Remains : 5/32721 places, 8/64200 transitions.
Stuttering acceptance computed with spot in 73 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 1655 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 136 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 1254 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 01:19:23] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-20 01:19:24] [INFO ] Implicit Places using invariants in 610 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 612 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 5 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 01:19:24] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-20 01:19:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-20 01:19:24] [INFO ] Invariant cache hit.
[2023-03-20 01:19:24] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 65 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 1937 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 24275 reset in 291 ms.
Product exploration explored 100000 steps with 24290 reset in 297 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 116 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 168 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 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 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 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 01:19:25] [INFO ] Invariant cache hit.
[2023-03-20 01:19:25] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-20 01:19:25] [INFO ] Invariant cache hit.
[2023-03-20 01:19:25] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-20 01:19:25] [INFO ] Invariant cache hit.
[2023-03-20 01:19:25] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 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 118 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 189 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 149 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 206 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)]
Product exploration explored 100000 steps with 24312 reset in 203 ms.
Product exploration explored 100000 steps with 24314 reset in 175 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 197 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 0 ms. Remains 7 /7 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-20 01:19:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 01:19:27] [INFO ] Invariant cache hit.
[2023-03-20 01:19:27] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 7/7 places, 13/13 transitions.
Built C files in :
/tmp/ltsmin11289243803951387488
[2023-03-20 01:19:27] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11289243803951387488
Running compilation step : cd /tmp/ltsmin11289243803951387488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin11289243803951387488;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11289243803951387488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15490273354310767757.hoa' '--buchi-type=spotba'
LTSmin run took 201 ms.
Treatment of property ServersAndClients-PT-100320-LTLFireability-01 finished in 5908 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-01 TRUE TECHNIQUES SHORTENING_INSENSITIVE
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 131 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 1171 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 01:19:29] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-20 01:19:30] [INFO ] Implicit Places using invariants in 751 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 753 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 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 01:19:30] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 01:19:30] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-20 01:19:30] [INFO ] Invariant cache hit.
[2023-03-20 01:19:30] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 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 1986 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 6325 reset in 123 ms.
Product exploration explored 100000 steps with 6275 reset in 126 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 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 160 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
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 473 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 157 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 158 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 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-20 01:19:31] [INFO ] Invariant cache hit.
[2023-03-20 01:19:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-20 01:19:32] [INFO ] Invariant cache hit.
[2023-03-20 01:19:32] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-20 01:19:32] [INFO ] Invariant cache hit.
[2023-03-20 01:19:32] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 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 377 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 167 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
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 444 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 113 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 6173 reset in 122 ms.
Product exploration explored 100000 steps with 6250 reset in 128 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 162 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 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-20 01:19:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 01:19:34] [INFO ] Invariant cache hit.
[2023-03-20 01:19:34] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41 ms. Remains : 5/5 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin1394862754766437715
[2023-03-20 01:19:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1394862754766437715
Running compilation step : cd /tmp/ltsmin1394862754766437715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 124 ms.
Running link step : cd /tmp/ltsmin1394862754766437715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1394862754766437715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17178138378131760578.hoa' '--buchi-type=spotba'
LTSmin run took 55 ms.
Treatment of property ServersAndClients-PT-100320-LTLFireability-04 finished in 6247 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
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 202 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 969 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 01:19:35] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 01:19:35] [INFO ] Implicit Places using invariants in 25 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 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 01:19:35] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 01:19:35] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-20 01:19:35] [INFO ] Invariant cache hit.
[2023-03-20 01:19:35] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2/32721 places, 3/64200 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1044 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 22852 reset in 47 ms.
Product exploration explored 100000 steps with 22849 reset in 55 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 89 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 142 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 113 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 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 199 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 1 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-20 01:19:36] [INFO ] Invariant cache hit.
[2023-03-20 01:19:36] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-20 01:19:36] [INFO ] Invariant cache hit.
[2023-03-20 01:19:36] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-20 01:19:36] [INFO ] Invariant cache hit.
[2023-03-20 01:19:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 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 123 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 208 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 150 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 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22855 reset in 82 ms.
Product exploration explored 100000 steps with 22835 reset in 93 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 191 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 01:19:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 01:19:38] [INFO ] Invariant cache hit.
[2023-03-20 01:19:38] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26 ms. Remains : 2/2 places, 3/3 transitions.
Built C files in :
/tmp/ltsmin4931654734676442254
[2023-03-20 01:19:38] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4931654734676442254
Running compilation step : cd /tmp/ltsmin4931654734676442254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 106 ms.
Running link step : cd /tmp/ltsmin4931654734676442254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4931654734676442254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7764483388141056606.hoa' '--buchi-type=spotba'
LTSmin run took 133 ms.
Treatment of property ServersAndClients-PT-100320-LTLFireability-10 finished in 4368 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-10 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-20 01:19:40] [INFO ] Flatten gal took : 1837 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5187056641488246778
[2023-03-20 01:19:41] [INFO ] Too many transitions (64200) to apply POR reductions. Disabling POR matrices.
[2023-03-20 01:19:42] [INFO ] Built C files in 474ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5187056641488246778
Running compilation step : cd /tmp/ltsmin5187056641488246778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-20 01:19:42] [INFO ] Applying decomposition
[2023-03-20 01:19:44] [INFO ] Flatten gal took : 1800 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12686762248643369360.txt' '-o' '/tmp/graph12686762248643369360.bin' '-w' '/tmp/graph12686762248643369360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12686762248643369360.bin' '-l' '-1' '-v' '-w' '/tmp/graph12686762248643369360.weights' '-q' '0' '-e' '0.001'
[2023-03-20 01:19:49] [INFO ] Decomposing Gal with order
[2023-03-20 01:19:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 01:20:17] [INFO ] Removed a total of 63851 redundant transitions.
[2023-03-20 01:20:18] [INFO ] Flatten gal took : 11898 ms
[2023-03-20 01:20:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 263 ms.
[2023-03-20 01:20:20] [INFO ] Time to serialize gal into /tmp/LTLFireability12617009607878821714.gal : 372 ms
[2023-03-20 01:20:20] [INFO ] Time to serialize properties into /tmp/LTLFireability44824946692512075.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12617009607878821714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability44824946692512075.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((G("(u303.sv203_c46<1)"))||(F(!(("(u303.sv203_c46>=1)")U("((i54.u62.sys_req62>=1)&&(u275.sv175>=1))"))))))))
Formula 0 simplified : XF(F!"(u303.sv203_c46<1)" & G("(u303.sv203_c46>=1)" U "((i54.u62.sys_req62>=1)&&(u275.sv175>=1))"))

BK_STOP 1679275674320

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ServersAndClients-PT-100320"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ServersAndClients-PT-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 r357-smll-167891806500492"
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 ;