Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 7.1K Feb 26 03:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 03:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 03:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 03:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 26 03:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 03:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 03:37 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-400080-LTLCardinality-00
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-01
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-02
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-03
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-04
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-05
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-06
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-07
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-08
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-09
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-10
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-11
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-12
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-13
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-14
FORMULA_NAME ServersAndClients-PT-400080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679302494668

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-400080
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-20 08:54:58] [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]
[2023-03-20 08:54:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:55:00] [INFO ] Load time of PNML (sax parser for PT used): 1721 ms
[2023-03-20 08:55:00] [INFO ] Transformed 33681 places.
[2023-03-20 08:55:00] [INFO ] Transformed 64800 transitions.
[2023-03-20 08:55:00] [INFO ] Parsed PT model containing 33681 places and 64800 transitions and 195200 arcs in 2236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ServersAndClients-PT-400080-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 993 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2023-03-20 08:55:04] [INFO ] Computed 881 place invariants in 2380 ms
[2023-03-20 08:55:10] [INFO ] Implicit Places using invariants in 7683 ms returned []
Implicit Place search using SMT only with invariants took 7730 ms to find 0 implicit places.
[2023-03-20 08:55:10] [INFO ] Invariant cache hit.
[2023-03-20 08:55:14] [INFO ] Dead Transitions using invariants and state equation in 4388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13141 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Support contains 41 out of 33681 places after structural reductions.
[2023-03-20 08:55:18] [INFO ] Flatten gal took : 3175 ms
[2023-03-20 08:55:20] [INFO ] Flatten gal took : 2214 ms
[2023-03-20 08:55:24] [INFO ] Input system was already deterministic with 64800 transitions.
Support contains 39 out of 33681 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1917 ms. (steps per millisecond=5 ) properties (out of 26) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-20 08:55:27] [INFO ] Invariant cache hit.
[2023-03-20 08:55:53] [INFO ] [Real]Absence check using 481 positive place invariants in 4719 ms returned unknown
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 08:55:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:55:53] [INFO ] After 25166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 33 out of 33681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31889 transitions
Trivial Post-agglo rules discarded 31889 transitions
Performed 31889 trivial Post agglomeration. Transition count delta: 31889
Iterating post reduction 0 with 31889 rules applied. Total rules applied 31889 place count 33681 transition count 32911
Reduce places removed 31889 places and 0 transitions.
Iterating post reduction 1 with 31889 rules applied. Total rules applied 63778 place count 1792 transition count 32911
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 63858 place count 1792 transition count 32831
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 20400 transitions
Reduce isomorphic transitions removed 20400 transitions.
Iterating post reduction 2 with 20532 rules applied. Total rules applied 84390 place count 1660 transition count 12431
Drop transitions removed 11169 transitions
Redundant transition composition rules discarded 11169 transitions
Iterating global reduction 3 with 11169 rules applied. Total rules applied 95559 place count 1660 transition count 1262
Discarding 369 places :
Implicit places reduction removed 369 places
Drop transitions removed 734 transitions
Trivial Post-agglo rules discarded 734 transitions
Performed 734 trivial Post agglomeration. Transition count delta: 734
Iterating post reduction 3 with 1103 rules applied. Total rules applied 96662 place count 1291 transition count 528
Reduce places removed 1101 places and 0 transitions.
Drop transitions removed 367 transitions
Reduce isomorphic transitions removed 367 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1469 rules applied. Total rules applied 98131 place count 190 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98132 place count 189 transition count 160
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 98133 place count 189 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 98134 place count 188 transition count 159
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 7 with 31 rules applied. Total rules applied 98165 place count 188 transition count 159
Applied a total of 98165 rules in 3501 ms. Remains 188 /33681 variables (removed 33493) and now considering 159/64800 (removed 64641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3502 ms. Remains : 188/33681 places, 159/64800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 22) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 159 rows 188 cols
[2023-03-20 08:55:57] [INFO ] Computed 93 place invariants in 1 ms
[2023-03-20 08:55:57] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2023-03-20 08:55:57] [INFO ] [Real]Absence check using 62 positive and 31 generalized place invariants in 9 ms returned sat
[2023-03-20 08:55:57] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:4
[2023-03-20 08:55:57] [INFO ] [Nat]Absence check using 62 positive place invariants in 21 ms returned sat
[2023-03-20 08:55:57] [INFO ] [Nat]Absence check using 62 positive and 31 generalized place invariants in 9 ms returned sat
[2023-03-20 08:55:57] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
FORMULA ServersAndClients-PT-400080-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-400080-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 33681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33681/33681 places, 64800/64800 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 33681 transition count 32803
Reduce places removed 32074 places and 0 transitions.
Ensure Unique test removed 30400 transitions
Reduce isomorphic transitions removed 30400 transitions.
Iterating post reduction 1 with 62474 rules applied. Total rules applied 94471 place count 1607 transition count 2403
Drop transitions removed 1197 transitions
Redundant transition composition rules discarded 1197 transitions
Iterating global reduction 2 with 1197 rules applied. Total rules applied 95668 place count 1607 transition count 1206
Discarding 397 places :
Implicit places reduction removed 397 places
Drop transitions removed 794 transitions
Trivial Post-agglo rules discarded 794 transitions
Performed 794 trivial Post agglomeration. Transition count delta: 794
Iterating post reduction 2 with 1191 rules applied. Total rules applied 96859 place count 1210 transition count 412
Reduce places removed 1191 places and 0 transitions.
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Iterating post reduction 3 with 1587 rules applied. Total rules applied 98446 place count 19 transition count 16
Applied a total of 98446 rules in 1316 ms. Remains 19 /33681 variables (removed 33662) and now considering 16/64800 (removed 64784) transitions.
// Phase 1: matrix 16 rows 19 cols
[2023-03-20 08:55:59] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-20 08:55:59] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1, 2, 3, 4, 5, 13, 15, 17]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 47 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/33681 places, 16/64800 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 7 / 10 are part of one of the 1 SCC in 4 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 08:55:59] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-20 08:55:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 08:55:59] [INFO ] Invariant cache hit.
[2023-03-20 08:55:59] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/33681 places, 7/64800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1413 ms. Remains : 4/33681 places, 7/64800 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-400080-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s2), p1:(LEQ s1 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 429 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 3 in 1 ms.
FORMULA ServersAndClients-PT-400080-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400080-LTLCardinality-00 finished in 2163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 549 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2023-03-20 08:56:02] [INFO ] Computed 881 place invariants in 1538 ms
[2023-03-20 08:56:07] [INFO ] Implicit Places using invariants in 6758 ms returned []
Implicit Place search using SMT only with invariants took 6764 ms to find 0 implicit places.
[2023-03-20 08:56:07] [INFO ] Invariant cache hit.
[2023-03-20 08:56:12] [INFO ] Dead Transitions using invariants and state equation in 4772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12095 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-LTLCardinality-02 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:(GT s16529 s9917)], 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 7 ms.
FORMULA ServersAndClients-PT-400080-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-400080-LTLCardinality-02 finished in 12369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 446 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
[2023-03-20 08:56:13] [INFO ] Invariant cache hit.
[2023-03-20 08:56:17] [INFO ] Implicit Places using invariants in 4510 ms returned []
Implicit Place search using SMT only with invariants took 4514 ms to find 0 implicit places.
[2023-03-20 08:56:17] [INFO ] Invariant cache hit.
[2023-03-20 08:56:22] [INFO ] Dead Transitions using invariants and state equation in 4331 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9300 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-400080-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s23782)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 23700 steps with 11850 reset in 10002 ms.
Product exploration timeout after 25520 steps with 12760 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, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-400080-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-400080-LTLCardinality-03 finished in 30350 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||(F(G(!p0)) U p1))))))'
Support contains 4 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 472 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
[2023-03-20 08:56:43] [INFO ] Invariant cache hit.
[2023-03-20 08:56:48] [INFO ] Implicit Places using invariants in 4442 ms returned []
Implicit Place search using SMT only with invariants took 4446 ms to find 0 implicit places.
[2023-03-20 08:56:48] [INFO ] Invariant cache hit.
[2023-03-20 08:56:52] [INFO ] Dead Transitions using invariants and state equation in 4608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9537 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-400080-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s28408 s12697), p1:(LEQ s31771 s12325)], 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][false, false, false]]
Product exploration timeout after 34680 steps with 11560 reset in 10004 ms.
Product exploration timeout after 33480 steps with 11160 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-400080-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-400080-LTLCardinality-06 finished in 30487 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||X(p1)))))'
Support contains 2 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 537 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
[2023-03-20 08:57:14] [INFO ] Invariant cache hit.
[2023-03-20 08:57:18] [INFO ] Implicit Places using invariants in 4420 ms returned []
Implicit Place search using SMT only with invariants took 4422 ms to find 0 implicit places.
[2023-03-20 08:57:18] [INFO ] Invariant cache hit.
[2023-03-20 08:57:23] [INFO ] Dead Transitions using invariants and state equation in 4518 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9485 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-400080-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 1 s22838), p1:(LEQ 1 s32210)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 9864 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 5 ms.
FORMULA ServersAndClients-PT-400080-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400080-LTLCardinality-07 finished in 19547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 5 out of 33681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Drop transitions removed 31995 transitions
Trivial Post-agglo rules discarded 31995 transitions
Performed 31995 trivial Post agglomeration. Transition count delta: 31995
Iterating post reduction 0 with 31995 rules applied. Total rules applied 31995 place count 33681 transition count 32805
Reduce places removed 32070 places and 0 transitions.
Ensure Unique test removed 29600 transitions
Reduce isomorphic transitions removed 29600 transitions.
Iterating post reduction 1 with 61670 rules applied. Total rules applied 93665 place count 1611 transition count 3205
Drop transitions removed 1995 transitions
Redundant transition composition rules discarded 1995 transitions
Iterating global reduction 2 with 1995 rules applied. Total rules applied 95660 place count 1611 transition count 1210
Discarding 395 places :
Implicit places reduction removed 395 places
Drop transitions removed 790 transitions
Trivial Post-agglo rules discarded 790 transitions
Performed 790 trivial Post agglomeration. Transition count delta: 790
Iterating post reduction 2 with 1185 rules applied. Total rules applied 96845 place count 1216 transition count 420
Reduce places removed 1185 places and 0 transitions.
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 394 transitions.
Iterating post reduction 3 with 1579 rules applied. Total rules applied 98424 place count 31 transition count 26
Applied a total of 98424 rules in 998 ms. Remains 31 /33681 variables (removed 33650) and now considering 26/64800 (removed 64774) transitions.
// Phase 1: matrix 26 rows 31 cols
[2023-03-20 08:57:34] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-20 08:57:34] [INFO ] Implicit Places using invariants in 71 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 21, 23, 25, 27, 29]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 74 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/33681 places, 26/64800 transitions.
Graph (trivial) has 16 edges and 16 vertex of which 11 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Applied a total of 1 rules in 2 ms. Remains 6 /16 variables (removed 10) and now considering 11/26 (removed 15) transitions.
// Phase 1: matrix 11 rows 6 cols
[2023-03-20 08:57:34] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 08:57:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-20 08:57:34] [INFO ] Invariant cache hit.
[2023-03-20 08:57:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/33681 places, 11/64800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1123 ms. Remains : 6/33681 places, 11/64800 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-400080-LTLCardinality-08 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:(LEQ s4 s3), p0:(AND (GT s2 s1) (GT 3 s5))], 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 2960 reset in 157 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 5 in 0 ms.
FORMULA ServersAndClients-PT-400080-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-400080-LTLCardinality-08 finished in 1403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p0 U (G(p1)||X(p2)))))'
Support contains 6 out of 33681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33681/33681 places, 64800/64800 transitions.
Applied a total of 0 rules in 721 ms. Remains 33681 /33681 variables (removed 0) and now considering 64800/64800 (removed 0) transitions.
// Phase 1: matrix 64800 rows 33681 cols
[2023-03-20 08:57:36] [INFO ] Computed 881 place invariants in 1451 ms
[2023-03-20 08:57:41] [INFO ] Implicit Places using invariants in 6041 ms returned []
Implicit Place search using SMT only with invariants took 6046 ms to find 0 implicit places.
[2023-03-20 08:57:41] [INFO ] Invariant cache hit.
[2023-03-20 08:57:45] [INFO ] Dead Transitions using invariants and state equation in 4269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11048 ms. Remains : 33681/33681 places, 64800/64800 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-400080-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s13184 s21012), p1:(LEQ s12422 s29757), p2:(LEQ s17786 s1810)], 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 timeout after 26380 steps with 13190 reset in 10003 ms.
Product exploration timeout after 25890 steps with 12945 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 14 factoid took 438 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-400080-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-400080-LTLCardinality-12 finished in 32504 ms.
All properties solved by simple procedures.
Total runtime 188840 ms.

BK_STOP 1679302688038

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-400080"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ServersAndClients-PT-400080, 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 r357-smll-167891806600531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-400080.tgz
mv ServersAndClients-PT-400080 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 ;