Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679102300392.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ServersAndClients-PT-100080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102300392
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 15:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 13 15:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 13 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.9M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716893560984

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100080
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 10:52:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 10:52:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:52:42] [INFO ] Load time of PNML (sax parser for PT used): 381 ms
[2024-05-28 10:52:42] [INFO ] Transformed 8481 places.
[2024-05-28 10:52:43] [INFO ] Transformed 16200 transitions.
[2024-05-28 10:52:43] [INFO ] Found NUPN structural information;
[2024-05-28 10:52:43] [INFO ] Parsed PT model containing 8481 places and 16200 transitions and 48800 arcs in 638 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-100080-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1850 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2024-05-28 10:52:45] [INFO ] Computed 281 invariants in 258 ms
[2024-05-28 10:52:46] [INFO ] Implicit Places using invariants in 1519 ms returned []
Implicit Place search using SMT only with invariants took 1544 ms to find 0 implicit places.
[2024-05-28 10:52:46] [INFO ] Invariant cache hit.
[2024-05-28 10:52:48] [INFO ] Dead Transitions using invariants and state equation in 1294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4695 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Support contains 19 out of 8481 places after structural reductions.
[2024-05-28 10:52:49] [INFO ] Flatten gal took : 776 ms
[2024-05-28 10:52:49] [INFO ] Flatten gal took : 556 ms
[2024-05-28 10:52:50] [INFO ] Input system was already deterministic with 16200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 850 ms. (steps per millisecond=11 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :1
Running SMT prover for 9 properties.
[2024-05-28 10:52:52] [INFO ] Invariant cache hit.
[2024-05-28 10:52:55] [INFO ] [Real]Absence check using 181 positive place invariants in 479 ms returned sat
[2024-05-28 10:52:55] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 163 ms returned sat
[2024-05-28 10:53:17] [INFO ] After 20403ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:7
[2024-05-28 10:53:42] [INFO ] Deduced a trap composed of 2 places in 25524 ms of which 10 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-28 10:53:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 10:53:42] [INFO ] After 50568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 17 ms.
Support contains 14 out of 8481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7907 transitions
Trivial Post-agglo rules discarded 7907 transitions
Performed 7907 trivial Post agglomeration. Transition count delta: 7907
Iterating post reduction 0 with 7907 rules applied. Total rules applied 7907 place count 8481 transition count 8293
Reduce places removed 7907 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 7987 rules applied. Total rules applied 15894 place count 574 transition count 8213
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 6800 transitions
Reduce isomorphic transitions removed 6800 transitions.
Iterating post reduction 2 with 6949 rules applied. Total rules applied 22843 place count 425 transition count 1413
Drop transitions removed 1087 transitions
Redundant transition composition rules discarded 1087 transitions
Iterating global reduction 3 with 1087 rules applied. Total rules applied 23930 place count 425 transition count 326
Discarding 88 places :
Implicit places reduction removed 88 places
Drop transitions removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 3 with 262 rules applied. Total rules applied 24192 place count 337 transition count 152
Reduce places removed 261 places and 0 transitions.
Drop transitions removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 349 rules applied. Total rules applied 24541 place count 76 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 24542 place count 75 transition count 64
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 24554 place count 75 transition count 64
Applied a total of 24554 rules in 297 ms. Remains 75 /8481 variables (removed 8406) and now considering 64/16200 (removed 16136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 75/8481 places, 64/16200 transitions.
Finished random walk after 134 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=44 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8481 transition count 8201
Reduce places removed 8078 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 1 with 15878 rules applied. Total rules applied 23877 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 23976 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 24273 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 24668 place count 7 transition count 6
Applied a total of 24668 rules in 135 ms. Remains 7 /8481 variables (removed 8474) and now considering 6/16200 (removed 16194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-28 10:53:43] [INFO ] Computed 4 invariants in 15 ms
[2024-05-28 10:53:43] [INFO ] Implicit Places using invariants in 115 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 117 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/8481 places, 6/16200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 2 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 3 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-28 10:53:43] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:53:43] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 10:53:43] [INFO ] Invariant cache hit.
[2024-05-28 10:53:43] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/8481 places, 3/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 306 ms. Remains : 2/8481 places, 3/16200 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 0), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLCardinality-00 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7917 transitions
Trivial Post-agglo rules discarded 7917 transitions
Performed 7917 trivial Post agglomeration. Transition count delta: 7917
Iterating post reduction 0 with 7917 rules applied. Total rules applied 7917 place count 8481 transition count 8283
Reduce places removed 7917 places and 0 transitions.
Iterating post reduction 1 with 7917 rules applied. Total rules applied 15834 place count 564 transition count 8283
Applied a total of 15834 rules in 396 ms. Remains 564 /8481 variables (removed 7917) and now considering 8283/16200 (removed 7917) transitions.
[2024-05-28 10:53:44] [INFO ] Flow matrix only has 465 transitions (discarded 7818 similar events)
// Phase 1: matrix 465 rows 564 cols
[2024-05-28 10:53:44] [INFO ] Computed 281 invariants in 4 ms
[2024-05-28 10:53:50] [INFO ] Implicit Places using invariants in 5718 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, 403, 405, 407, 409, 411, 413, 415, 417, 419, 421, 423, 425, 427, 429, 431, 433, 436, 438, 440, 442, 444, 446, 448, 450, 452, 454, 456, 458, 460, 462, 464, 466, 468, 470, 472, 474, 476, 478, 481, 483, 485, 487, 489, 491, 493, 495, 497, 499, 501, 503, 505, 507, 509, 511, 513, 515, 517, 519, 521, 523, 525, 527, 529, 531, 533, 535, 537, 539, 541, 543, 545, 547, 549, 551, 553, 555, 558, 560, 562]
Discarding 280 places :
Ensure Unique test removed 7818 transitions
Reduce isomorphic transitions removed 7818 transitions.
Implicit Place search using SMT only with invariants took 5744 ms to find 280 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/8481 places, 465/16200 transitions.
Graph (trivial) has 378 edges and 284 vertex of which 199 / 284 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 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 7 transition count 90
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 7 transition count 90
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 80 rules applied. Total rules applied 239 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 240 place count 6 transition count 10
Applied a total of 240 rules in 17 ms. Remains 6 /284 variables (removed 278) and now considering 10/465 (removed 455) transitions.
// Phase 1: matrix 10 rows 6 cols
[2024-05-28 10:53:50] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:53:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 10:53:50] [INFO ] Invariant cache hit.
[2024-05-28 10:53:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/8481 places, 10/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6221 ms. Remains : 6/8481 places, 10/16200 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s4 0) (EQ s5 1)), p0:(OR (EQ s0 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4670 reset in 179 ms.
Product exploration explored 100000 steps with 4776 reset in 111 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 10:53:50] [INFO ] Invariant cache hit.
[2024-05-28 10:53:50] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 10:53:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 10:53:50] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-28 10:53:51] [INFO ] Invariant cache hit.
[2024-05-28 10:53:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 10:53:51] [INFO ] Invariant cache hit.
[2024-05-28 10:53:51] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-28 10:53:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 10:53:51] [INFO ] Invariant cache hit.
[2024-05-28 10:53:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 6/6 places, 10/10 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, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4723 reset in 97 ms.
Product exploration explored 100000 steps with 4688 reset in 118 ms.
Built C files in :
/tmp/ltsmin11551220728836539514
[2024-05-28 10:53:52] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-28 10:53:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:53:52] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-28 10:53:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:53:52] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-28 10:53:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:53:52] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11551220728836539514
Running compilation step : cd /tmp/ltsmin11551220728836539514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 188 ms.
Running link step : cd /tmp/ltsmin11551220728836539514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11551220728836539514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9426984421120054946.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA ServersAndClients-PT-100080-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-100080-LTLCardinality-02 finished in 8707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7997 transitions
Trivial Post-agglo rules discarded 7997 transitions
Performed 7997 trivial Post agglomeration. Transition count delta: 7997
Iterating post reduction 0 with 7997 rules applied. Total rules applied 7997 place count 8481 transition count 8203
Reduce places removed 8074 places and 0 transitions.
Ensure Unique test removed 7600 transitions
Reduce isomorphic transitions removed 7600 transitions.
Iterating post reduction 1 with 15674 rules applied. Total rules applied 23671 place count 407 transition count 603
Drop transitions removed 297 transitions
Redundant transition composition rules discarded 297 transitions
Iterating global reduction 2 with 297 rules applied. Total rules applied 23968 place count 407 transition count 306
Discarding 97 places :
Implicit places reduction removed 97 places
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 2 with 291 rules applied. Total rules applied 24259 place count 310 transition count 112
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 387 rules applied. Total rules applied 24646 place count 19 transition count 16
Applied a total of 24646 rules in 98 ms. Remains 19 /8481 variables (removed 8462) and now considering 16/16200 (removed 16184) transitions.
// Phase 1: matrix 16 rows 19 cols
[2024-05-28 10:53:52] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 10:53:52] [INFO ] Implicit Places using invariants in 32 ms returned [0, 1, 2, 3, 4, 5, 13, 15, 17]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 33 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/8481 places, 16/16200 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 7 / 10 are part of one of the 1 SCC in 0 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 1 ms. Remains 4 /10 variables (removed 6) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-28 10:53:52] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:53:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 10:53:52] [INFO ] Invariant cache hit.
[2024-05-28 10:53:52] [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 : 4/8481 places, 7/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 4/8481 places, 7/16200 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2 1) (AND (EQ s3 0) (EQ s1 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLCardinality-04 finished in 284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2057 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2024-05-28 10:53:55] [INFO ] Computed 281 invariants in 104 ms
[2024-05-28 10:53:56] [INFO ] Implicit Places using invariants in 1285 ms returned []
Implicit Place search using SMT only with invariants took 1289 ms to find 0 implicit places.
[2024-05-28 10:53:56] [INFO ] Invariant cache hit.
[2024-05-28 10:53:57] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4574 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s6975 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ServersAndClients-PT-100080-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLCardinality-10 finished in 4738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F((F(p0)&&p0))&&p1))&&(X(X(p2)) U X(p1))))'
Support contains 6 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2248 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
[2024-05-28 10:54:00] [INFO ] Invariant cache hit.
[2024-05-28 10:54:01] [INFO ] Implicit Places using invariants in 1204 ms returned []
Implicit Place search using SMT only with invariants took 1206 ms to find 0 implicit places.
[2024-05-28 10:54:01] [INFO ] Invariant cache hit.
[2024-05-28 10:54:02] [INFO ] Dead Transitions using invariants and state equation in 1200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4668 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (OR (NOT p2) (NOT p1)), true]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s5192 0) (EQ s283 1)), p0:(OR (EQ s7836 0) (EQ s4296 1)), p2:(OR (EQ s3759 0) (EQ s3730 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8003 ms.
Product exploration explored 100000 steps with 50000 reset in 7962 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X p1), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100080-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100080-LTLCardinality-12 finished in 21023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)&&X(p1))))))'
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1941 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
[2024-05-28 10:54:20] [INFO ] Invariant cache hit.
[2024-05-28 10:54:21] [INFO ] Implicit Places using invariants in 1232 ms returned []
Implicit Place search using SMT only with invariants took 1233 ms to find 0 implicit places.
[2024-05-28 10:54:21] [INFO ] Invariant cache hit.
[2024-05-28 10:54:23] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4239 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s4046 1), p1:(NEQ s855 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 2723 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-100080-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLCardinality-15 finished in 7240 ms.
All properties solved by simple procedures.
Total runtime 103540 ms.

BK_STOP 1716893667079

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-100080"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ServersAndClients-PT-100080, 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 r351-tall-171679102300392"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-100080.tgz
mv ServersAndClients-PT-100080 execution
cd execution
if [ "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 ;