About the Execution of Smart+red for Szymanski-PT-b02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16217.151 | 2126312.00 | 2187744.00 | 9007.80 | TTFF?TTTFTFFF?TT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r491-tall-167912710500454.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 smartxred
Input is Szymanski-PT-b02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912710500454
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.6K Feb 26 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b02-ReachabilityCardinality-00
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-01
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-02
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-03
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-04
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-05
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-06
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-07
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-08
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-09
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-10
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-11
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-12
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-13
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-14
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679254769359
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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b02
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-19 19:39:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 19:39:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:39:31] [INFO ] Load time of PNML (sax parser for PT used): 490 ms
[2023-03-19 19:39:32] [INFO ] Transformed 568 places.
[2023-03-19 19:39:32] [INFO ] Transformed 8320 transitions.
[2023-03-19 19:39:32] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 639 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 17 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b02-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 3 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 8) seen :1
FORMULA Szymanski-PT-b02-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 19:39:33] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 19:39:33] [INFO ] Computed 3 place invariants in 43 ms
[2023-03-19 19:39:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 19:39:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 19:39:33] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-19 19:39:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 19:39:33] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:39:35] [INFO ] After 1978ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2023-03-19 19:39:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:39:49] [INFO ] After 13258ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :5 sat :1
[2023-03-19 19:39:52] [INFO ] Deduced a trap composed of 147 places in 683 ms of which 8 ms to minimize.
[2023-03-19 19:39:56] [INFO ] Deduced a trap composed of 51 places in 675 ms of which 1 ms to minimize.
[2023-03-19 19:39:59] [INFO ] Deduced a trap composed of 32 places in 763 ms of which 1 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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.Application.startNoEx(Application.java:902)
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-19 19:39:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 19:39:59] [INFO ] After 25779ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:6
FORMULA Szymanski-PT-b02-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b02-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b02-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b02-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b02-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 12 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 306 transition count 7938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 305 transition count 7810
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 305 transition count 7810
Applied a total of 129 rules in 515 ms. Remains 305 /308 variables (removed 3) and now considering 7810/8064 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 516 ms. Remains : 305/308 places, 7810/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 124607 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124607 steps, saw 43611 distinct states, run finished after 3007 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 19:40:03] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 19:40:03] [INFO ] Computed 1 place invariants in 29 ms
[2023-03-19 19:40:03] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 19:40:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 19:40:06] [INFO ] After 3305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 19:40:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:40:24] [INFO ] After 18068ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-19 19:40:24] [INFO ] After 21467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 23 ms.
Support contains 12 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 388 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 266 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 19:40:25] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 19:40:25] [INFO ] Invariant cache hit.
[2023-03-19 19:40:26] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-19 19:40:26] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 19:40:26] [INFO ] Invariant cache hit.
[2023-03-19 19:40:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:40:34] [INFO ] Implicit Places using invariants and state equation in 8188 ms returned []
Implicit Place search using SMT with State Equation took 8762 ms to find 0 implicit places.
[2023-03-19 19:40:35] [INFO ] Redundant transitions in 936 ms returned []
[2023-03-19 19:40:35] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 19:40:35] [INFO ] Invariant cache hit.
[2023-03-19 19:40:37] [INFO ] Dead Transitions using invariants and state equation in 2320 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12294 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 4688 edges and 305 vertex of which 23 / 305 are part of one of the 3 SCC in 5 ms
Free SCC test removed 20 places
Drop transitions removed 2568 transitions
Ensure Unique test removed 2665 transitions
Reduce isomorphic transitions removed 5233 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 1 rules applied. Total rules applied 2 place count 285 transition count 2576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 284 transition count 2576
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 284 transition count 2574
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 282 transition count 2574
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 281 transition count 2573
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 280 transition count 2573
Drop transitions removed 418 transitions
Redundant transition composition rules discarded 418 transitions
Iterating global reduction 2 with 418 rules applied. Total rules applied 429 place count 280 transition count 2155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 429 place count 280 transition count 2154
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 431 place count 279 transition count 2154
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 279 transition count 2154
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 279 transition count 2153
Applied a total of 433 rules in 386 ms. Remains 279 /305 variables (removed 26) and now considering 2153/7810 (removed 5657) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2153 rows 279 cols
[2023-03-19 19:40:38] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 19:40:38] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 19:40:38] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 19:40:39] [INFO ] After 934ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 19:40:39] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-19 19:40:39] [INFO ] After 805ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 19:40:40] [INFO ] After 1200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 400 ms.
[2023-03-19 19:40:40] [INFO ] After 2642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-19 19:40:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-19 19:40:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7810 transitions and 31364 arcs took 32 ms.
[2023-03-19 19:40:41] [INFO ] Flatten gal took : 473 ms
Total runtime 70119 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Szymanski (PT), instance b02
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 305 places, 7810 transitions, 31364 arcs.
Final Score: 127136.971
Took : 126 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Szymanski-PT-b02-ReachabilityCardinality-04 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P179)) )) | ( ( ( ( 1 ) <= (tk(P64)) ) | ( ( (tk(P74)) <= ( 1 ) ) & ( (tk(P290)) <= ( 1 ) ) ) ) & ( ( ( 1 ) <= (tk(P304)) ) | ( ( ( ( 1 ) <= (tk(P249)) ) & ( (tk(P164)) <= ( 0 ) ) ) & ( ( ( 2 ) <= (tk(P218)) ) & ( (tk(P175)) <= ( 2 ) ) ) ) ) ) )))
PROPERTY: Szymanski-PT-b02-ReachabilityCardinality-13 (reachable & potential(( (! ( (tk(P291)) <= ( 2 ) )) | ( ( ( 2 ) <= (tk(P180)) ) | (! ( (tk(P243)) <= ( 0 ) )) ) )))
BK_STOP 1679256895671
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 550 Killed ${SMART}/smart ${INPUT_SM}
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="Szymanski-PT-b02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Szymanski-PT-b02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r491-tall-167912710500454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b02.tgz
mv Szymanski-PT-b02 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;