Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 7.1K Feb 26 03:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 03:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 03:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 03:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 03:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 03:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 26 03:49 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-200160-LTLCardinality-00
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-01
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-02
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-03
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-04
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-05
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-06
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-07
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-08
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-09
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-10
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-11
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-12
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-13
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-14
FORMULA_NAME ServersAndClients-PT-200160-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679335908946

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-200160
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 18:11:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:11:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:11:53] [INFO ] Load time of PNML (sax parser for PT used): 1846 ms
[2023-03-20 18:11:54] [INFO ] Transformed 32961 places.
[2023-03-20 18:11:54] [INFO ] Transformed 64400 transitions.
[2023-03-20 18:11:54] [INFO ] Parsed PT model containing 32961 places and 64400 transitions and 193600 arcs in 2228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ServersAndClients-PT-200160-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200160-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200160-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200160-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200160-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 819 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2023-03-20 18:11:57] [INFO ] Computed 561 place invariants in 1549 ms
[2023-03-20 18:12:02] [INFO ] Implicit Places using invariants in 7024 ms returned []
Implicit Place search using SMT only with invariants took 7071 ms to find 0 implicit places.
[2023-03-20 18:12:02] [INFO ] Invariant cache hit.
[2023-03-20 18:12:07] [INFO ] Dead Transitions using invariants and state equation in 4671 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12585 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Support contains 45 out of 32961 places after structural reductions.
[2023-03-20 18:12:10] [INFO ] Flatten gal took : 2534 ms
[2023-03-20 18:12:12] [INFO ] Flatten gal took : 1880 ms
[2023-03-20 18:12:17] [INFO ] Input system was already deterministic with 64400 transitions.
Support contains 43 out of 32961 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1647 ms. (steps per millisecond=6 ) properties (out of 26) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-20 18:12:19] [INFO ] Invariant cache hit.
[2023-03-20 18:12:43] [INFO ] [Real]Absence check using 361 positive place invariants in 1592 ms returned sat
[2023-03-20 18:12:44] [INFO ] [Real]Absence check using 361 positive and 200 generalized place invariants in 791 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 18:12:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 18:12:44] [INFO ] After 25250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 38 out of 32961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31963 transitions
Trivial Post-agglo rules discarded 31963 transitions
Performed 31963 trivial Post agglomeration. Transition count delta: 31963
Iterating post reduction 0 with 31963 rules applied. Total rules applied 31963 place count 32961 transition count 32437
Reduce places removed 32090 places and 0 transitions.
Ensure Unique test removed 25200 transitions
Reduce isomorphic transitions removed 25200 transitions.
Iterating post reduction 1 with 57290 rules applied. Total rules applied 89253 place count 871 transition count 7237
Drop transitions removed 6563 transitions
Redundant transition composition rules discarded 6563 transitions
Iterating global reduction 2 with 6563 rules applied. Total rules applied 95816 place count 871 transition count 674
Discarding 165 places :
Implicit places reduction removed 165 places
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 2 with 495 rules applied. Total rules applied 96311 place count 706 transition count 344
Reduce places removed 495 places and 0 transitions.
Drop transitions removed 165 transitions
Reduce isomorphic transitions removed 165 transitions.
Iterating post reduction 3 with 660 rules applied. Total rules applied 96971 place count 211 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 96971 place count 211 transition count 178
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 96974 place count 209 transition count 178
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 97008 place count 209 transition count 178
Applied a total of 97008 rules in 2359 ms. Remains 209 /32961 variables (removed 32752) and now considering 178/64400 (removed 64222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2359 ms. Remains : 209/32961 places, 178/64400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 23) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 178 rows 209 cols
[2023-03-20 18:12:48] [INFO ] Computed 103 place invariants in 2 ms
[2023-03-20 18:12:48] [INFO ] [Real]Absence check using 69 positive place invariants in 19 ms returned sat
[2023-03-20 18:12:48] [INFO ] [Real]Absence check using 69 positive and 34 generalized place invariants in 8 ms returned sat
[2023-03-20 18:12:48] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2023-03-20 18:12:48] [INFO ] [Nat]Absence check using 69 positive place invariants in 21 ms returned sat
[2023-03-20 18:12:48] [INFO ] [Nat]Absence check using 69 positive and 34 generalized place invariants in 11 ms returned sat
[2023-03-20 18:12:48] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ServersAndClients-PT-200160-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
FORMULA ServersAndClients-PT-200160-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200160-LTLCardinality-08 FALSE 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((F(p0)&&X(G(p1))))))'
Support contains 3 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 703 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2023-03-20 18:12:50] [INFO ] Computed 561 place invariants in 963 ms
[2023-03-20 18:12:55] [INFO ] Implicit Places using invariants in 5436 ms returned []
Implicit Place search using SMT only with invariants took 5442 ms to find 0 implicit places.
[2023-03-20 18:12:55] [INFO ] Invariant cache hit.
[2023-03-20 18:12:59] [INFO ] Dead Transitions using invariants and state equation in 4391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10546 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 474 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ServersAndClients-PT-200160-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(GT s28462 s24560), p0:(GT 1 s939)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 14 ms.
FORMULA ServersAndClients-PT-200160-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLCardinality-00 finished in 11266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(F(!p0))))))'
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 385 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2023-03-20 18:13:00] [INFO ] Invariant cache hit.
[2023-03-20 18:13:05] [INFO ] Implicit Places using invariants in 4673 ms returned []
Implicit Place search using SMT only with invariants took 4683 ms to find 0 implicit places.
[2023-03-20 18:13:05] [INFO ] Invariant cache hit.
[2023-03-20 18:13:09] [INFO ] Dead Transitions using invariants and state equation in 4355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9432 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 186 ms :[p0, true, true, true, true]
Running random walk in product with property : ServersAndClients-PT-200160-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p0:(LEQ s27395 s1654)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 9019 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-200160-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200160-LTLCardinality-06 finished in 18778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||X(p0))))))'
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 290 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2023-03-20 18:13:19] [INFO ] Invariant cache hit.
[2023-03-20 18:13:23] [INFO ] Implicit Places using invariants in 4415 ms returned []
Implicit Place search using SMT only with invariants took 4417 ms to find 0 implicit places.
[2023-03-20 18:13:23] [INFO ] Invariant cache hit.
[2023-03-20 18:13:28] [INFO ] Dead Transitions using invariants and state equation in 4685 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9407 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ServersAndClients-PT-200160-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(LEQ s826 s17766)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 51900 steps with 12975 reset in 10002 ms.
Product exploration timeout after 55180 steps with 13795 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 97 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1081 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 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4484 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4484 steps, saw 1650 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 18:13:53] [INFO ] Invariant cache hit.
[2023-03-20 18:14:01] [INFO ] After 7580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 18:14:10] [INFO ] [Nat]Absence check using 361 positive place invariants in 1971 ms returned sat
[2023-03-20 18:14:10] [INFO ] [Nat]Absence check using 361 positive and 200 generalized place invariants in 752 ms returned sat
[2023-03-20 18:14:26] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31998 transitions
Trivial Post-agglo rules discarded 31998 transitions
Performed 31998 trivial Post agglomeration. Transition count delta: 31998
Iterating post reduction 0 with 31998 rules applied. Total rules applied 31998 place count 32961 transition count 32402
Reduce places removed 32156 places and 0 transitions.
Ensure Unique test removed 31400 transitions
Reduce isomorphic transitions removed 31400 transitions.
Iterating post reduction 1 with 63556 rules applied. Total rules applied 95554 place count 805 transition count 1002
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 2 with 398 rules applied. Total rules applied 95952 place count 805 transition count 604
Discarding 198 places :
Implicit places reduction removed 198 places
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 2 with 594 rules applied. Total rules applied 96546 place count 607 transition count 208
Reduce places removed 594 places and 0 transitions.
Drop transitions removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 792 rules applied. Total rules applied 97338 place count 13 transition count 10
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 97340 place count 13 transition count 10
Applied a total of 97340 rules in 1254 ms. Remains 13 /32961 variables (removed 32948) and now considering 10/64400 (removed 64390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1255 ms. Remains : 13/32961 places, 10/64400 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 395 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2023-03-20 18:14:28] [INFO ] Invariant cache hit.
[2023-03-20 18:14:33] [INFO ] Implicit Places using invariants in 5023 ms returned []
Implicit Place search using SMT only with invariants took 5047 ms to find 0 implicit places.
[2023-03-20 18:14:33] [INFO ] Invariant cache hit.
[2023-03-20 18:14:37] [INFO ] Dead Transitions using invariants and state equation in 4239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9700 ms. Remains : 32961/32961 places, 64400/64400 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 127 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1049 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 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4526 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4526 steps, saw 1650 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 18:14:43] [INFO ] Invariant cache hit.
[2023-03-20 18:14:50] [INFO ] After 7028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 18:14:59] [INFO ] [Nat]Absence check using 361 positive place invariants in 2111 ms returned sat
[2023-03-20 18:15:00] [INFO ] [Nat]Absence check using 361 positive and 200 generalized place invariants in 1110 ms returned sat
[2023-03-20 18:15:15] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31998 transitions
Trivial Post-agglo rules discarded 31998 transitions
Performed 31998 trivial Post agglomeration. Transition count delta: 31998
Iterating post reduction 0 with 31998 rules applied. Total rules applied 31998 place count 32961 transition count 32402
Reduce places removed 32156 places and 0 transitions.
Ensure Unique test removed 31400 transitions
Reduce isomorphic transitions removed 31400 transitions.
Iterating post reduction 1 with 63556 rules applied. Total rules applied 95554 place count 805 transition count 1002
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 2 with 398 rules applied. Total rules applied 95952 place count 805 transition count 604
Discarding 198 places :
Implicit places reduction removed 198 places
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 2 with 594 rules applied. Total rules applied 96546 place count 607 transition count 208
Reduce places removed 594 places and 0 transitions.
Drop transitions removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 792 rules applied. Total rules applied 97338 place count 13 transition count 10
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 97340 place count 13 transition count 10
Applied a total of 97340 rules in 816 ms. Remains 13 /32961 variables (removed 32948) and now considering 10/64400 (removed 64390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 816 ms. Remains : 13/32961 places, 10/64400 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration timeout after 51560 steps with 12890 reset in 10002 ms.
Product exploration timeout after 52250 steps with 13062 reset in 10001 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Performed 31083 Post agglomeration using F-continuation condition.
Performed 31998 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31998 rules applied. Total rules applied 31998 place count 32961 transition count 64400
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 32155 place count 32804 transition count 33000
Deduced a syphon composed of 31998 places in 12 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 32312 place count 32804 transition count 33000
Deduced a syphon composed of 31998 places in 11 ms
Applied a total of 32312 rules in 32451 ms. Remains 32804 /32961 variables (removed 157) and now considering 33000/64400 (removed 31400) transitions.
[2023-03-20 18:16:10] [INFO ] Flow matrix only has 32602 transitions (discarded 398 similar events)
// Phase 1: matrix 32602 rows 32804 cols
[2023-03-20 18:16:30] [INFO ] Computed 404 place invariants in 20107 ms
[2023-03-20 18:16:34] [INFO ] Dead Transitions using invariants and state equation in 24644 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32804/32961 places, 33000/64400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57111 ms. Remains : 32804/32961 places, 33000/64400 transitions.
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 616 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2023-03-20 18:16:36] [INFO ] Computed 561 place invariants in 866 ms
[2023-03-20 18:16:40] [INFO ] Implicit Places using invariants in 5572 ms returned []
Implicit Place search using SMT only with invariants took 5577 ms to find 0 implicit places.
[2023-03-20 18:16:41] [INFO ] Invariant cache hit.
[2023-03-20 18:16:45] [INFO ] Dead Transitions using invariants and state equation in 4730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10927 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Treatment of property ServersAndClients-PT-200160-LTLCardinality-10 finished in 210241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(F(((p1&&X(p2))||G(p2))))))))'
Support contains 4 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 646 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2023-03-20 18:16:49] [INFO ] Invariant cache hit.
[2023-03-20 18:16:54] [INFO ] Implicit Places using invariants in 4774 ms returned []
Implicit Place search using SMT only with invariants took 4781 ms to find 0 implicit places.
[2023-03-20 18:16:54] [INFO ] Invariant cache hit.
[2023-03-20 18:16:59] [INFO ] Dead Transitions using invariants and state equation in 4423 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9863 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s24513 s167), p2:(GT 1 s27746), p1:(GT 1 s15847)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8211 ms.
Product exploration explored 100000 steps with 0 reset in 7713 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 p2 p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Property proved to be false thanks to negative knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-200160-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-200160-LTLCardinality-11 finished in 26666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1&&F(p2))))))'
Support contains 5 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 396 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2023-03-20 18:17:16] [INFO ] Invariant cache hit.
[2023-03-20 18:17:20] [INFO ] Implicit Places using invariants in 4446 ms returned []
Implicit Place search using SMT only with invariants took 4447 ms to find 0 implicit places.
[2023-03-20 18:17:20] [INFO ] Invariant cache hit.
[2023-03-20 18:17:24] [INFO ] Dead Transitions using invariants and state equation in 4240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9101 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ServersAndClients-PT-200160-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (LEQ 1 s18355) (LEQ s25342 s17263)), p1:(GT 1 s18355), p2:(LEQ s16219 s3026)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 32770 steps with 16385 reset in 10001 ms.
Product exploration timeout after 32680 steps with 16340 reset in 10005 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2)
Knowledge based reduction with 6 factoid took 312 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-200160-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-200160-LTLCardinality-12 finished in 30351 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 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31997 transitions
Trivial Post-agglo rules discarded 31997 transitions
Performed 31997 trivial Post agglomeration. Transition count delta: 31997
Iterating post reduction 0 with 31997 rules applied. Total rules applied 31997 place count 32961 transition count 32403
Reduce places removed 32154 places and 0 transitions.
Ensure Unique test removed 31200 transitions
Reduce isomorphic transitions removed 31200 transitions.
Iterating post reduction 1 with 63354 rules applied. Total rules applied 95351 place count 807 transition count 1203
Drop transitions removed 597 transitions
Redundant transition composition rules discarded 597 transitions
Iterating global reduction 2 with 597 rules applied. Total rules applied 95948 place count 807 transition count 606
Discarding 197 places :
Implicit places reduction removed 197 places
Drop transitions removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 2 with 591 rules applied. Total rules applied 96539 place count 610 transition count 212
Reduce places removed 591 places and 0 transitions.
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 787 rules applied. Total rules applied 97326 place count 19 transition count 16
Applied a total of 97326 rules in 861 ms. Remains 19 /32961 variables (removed 32942) and now considering 16/64400 (removed 64384) transitions.
// Phase 1: matrix 16 rows 19 cols
[2023-03-20 18:17:47] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-20 18:17:47] [INFO ] Implicit Places using invariants in 100 ms returned [0, 1, 2, 3, 4, 5, 13, 15, 17]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 103 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/32961 places, 16/64400 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 7 / 10 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Applied a total of 1 rules in 6 ms. Remains 4 /10 variables (removed 6) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-20 18:17:47] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 18:17:47] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-20 18:17:47] [INFO ] Invariant cache hit.
[2023-03-20 18:17:47] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/32961 places, 7/64400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1031 ms. Remains : 4/32961 places, 7/64400 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLCardinality-13 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 (LEQ 1 s3) (LEQ s1 s2))], 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-200160-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLCardinality-13 finished in 1112 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(G(p0))&&F(p1))))'
Support contains 4 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31996 transitions
Trivial Post-agglo rules discarded 31996 transitions
Performed 31996 trivial Post agglomeration. Transition count delta: 31996
Iterating post reduction 0 with 31996 rules applied. Total rules applied 31996 place count 32961 transition count 32404
Reduce places removed 32152 places and 0 transitions.
Ensure Unique test removed 31000 transitions
Reduce isomorphic transitions removed 31000 transitions.
Iterating post reduction 1 with 63152 rules applied. Total rules applied 95148 place count 809 transition count 1404
Drop transitions removed 796 transitions
Redundant transition composition rules discarded 796 transitions
Iterating global reduction 2 with 796 rules applied. Total rules applied 95944 place count 809 transition count 608
Discarding 196 places :
Implicit places reduction removed 196 places
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 588 rules applied. Total rules applied 96532 place count 613 transition count 216
Reduce places removed 588 places and 0 transitions.
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 3 with 783 rules applied. Total rules applied 97315 place count 25 transition count 21
Applied a total of 97315 rules in 849 ms. Remains 25 /32961 variables (removed 32936) and now considering 21/64400 (removed 64379) transitions.
// Phase 1: matrix 21 rows 25 cols
[2023-03-20 18:17:48] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-20 18:17:48] [INFO ] Implicit Places using invariants in 36 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 17, 19, 21, 23]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 38 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/32961 places, 21/64400 transitions.
Graph (trivial) has 13 edges and 13 vertex of which 9 / 13 are part of one of the 1 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Applied a total of 1 rules in 3 ms. Remains 5 /13 variables (removed 8) and now considering 9/21 (removed 12) transitions.
// Phase 1: matrix 9 rows 5 cols
[2023-03-20 18:17:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 18:17:48] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 18:17:48] [INFO ] Invariant cache hit.
[2023-03-20 18:17:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/32961 places, 9/64400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 929 ms. Remains : 5/32961 places, 9/64400 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s4 s2), p1:(LEQ s1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200160-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLCardinality-14 finished in 1078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(!p0)&&X(!p1)))))'
Support contains 4 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 451 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2023-03-20 18:17:49] [INFO ] Computed 561 place invariants in 993 ms
[2023-03-20 18:17:54] [INFO ] Implicit Places using invariants in 5388 ms returned []
Implicit Place search using SMT only with invariants took 5393 ms to find 0 implicit places.
[2023-03-20 18:17:54] [INFO ] Invariant cache hit.
[2023-03-20 18:17:58] [INFO ] Dead Transitions using invariants and state equation in 4334 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10182 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR p0 p1), (OR p0 p1), (OR p1 p0), p1, p0, true]
Running random walk in product with property : ServersAndClients-PT-200160-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s21320 s25369), p1:(LEQ s6087 s31201)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA ServersAndClients-PT-200160-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLCardinality-15 finished in 10494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||X(p0))))))'
[2023-03-20 18:18:01] [INFO ] Flatten gal took : 1901 ms
[2023-03-20 18:18:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 18:18:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32961 places, 64400 transitions and 193600 arcs took 214 ms.
Total runtime 369317 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1014/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ServersAndClients-PT-200160-LTLCardinality-10

BK_STOP 1679336546377

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-200160.tgz
mv ServersAndClients-PT-200160 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;