About the Execution of Smart+red for TokenRing-PT-020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16119.792 | 911383.00 | 871354.00 | 49899.00 | FTFFFFFFFFT??TFT | 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-167912710800678.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 TokenRing-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912710800678
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 130M
-rw-r--r-- 1 mcc users 700K Feb 25 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Feb 25 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4M Feb 25 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 20M Feb 25 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 246K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 823K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3M Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3M Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 725K Feb 25 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 25 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17M Feb 25 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62M Feb 25 16:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 47K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 121K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 4.0M 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 TokenRing-PT-020-ReachabilityCardinality-00
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-01
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-02
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-03
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-04
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-05
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-06
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-07
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-08
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-09
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-10
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-11
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-12
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-13
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-14
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679280286219
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=TokenRing-PT-020
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-20 02:44:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 02:44:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:44:48] [INFO ] Load time of PNML (sax parser for PT used): 296 ms
[2023-03-20 02:44:48] [INFO ] Transformed 441 places.
[2023-03-20 02:44:48] [INFO ] Transformed 8421 transitions.
[2023-03-20 02:44:48] [INFO ] Parsed PT model containing 441 places and 8421 transitions and 33684 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 147 ms.
Working with output stream class java.io.PrintStream
FORMULA TokenRing-PT-020-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 8) seen :4
FORMULA TokenRing-PT-020-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 02:44:50] [INFO ] Computed 21 place invariants in 54 ms
[2023-03-20 02:44:51] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:44:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-20 02:44:53] [INFO ] After 1708ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-20 02:44:53] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 02:44:58] [INFO ] After 5455ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-20 02:45:01] [INFO ] Deduced a trap composed of 250 places in 2008 ms of which 11 ms to minimize.
[2023-03-20 02:45:02] [INFO ] Deduced a trap composed of 255 places in 561 ms of which 1 ms to minimize.
[2023-03-20 02:45:03] [INFO ] Deduced a trap composed of 246 places in 657 ms of which 1 ms to minimize.
[2023-03-20 02:45:03] [INFO ] Deduced a trap composed of 245 places in 626 ms of which 2 ms to minimize.
[2023-03-20 02:45:04] [INFO ] Deduced a trap composed of 243 places in 653 ms of which 1 ms to minimize.
[2023-03-20 02:45:05] [INFO ] Deduced a trap composed of 246 places in 631 ms of which 0 ms to minimize.
[2023-03-20 02:45:06] [INFO ] Deduced a trap composed of 246 places in 629 ms of which 0 ms to minimize.
[2023-03-20 02:45:07] [INFO ] Deduced a trap composed of 246 places in 643 ms of which 1 ms to minimize.
[2023-03-20 02:45:08] [INFO ] Deduced a trap composed of 246 places in 637 ms of which 1 ms to minimize.
[2023-03-20 02:45:09] [INFO ] Deduced a trap composed of 245 places in 614 ms of which 1 ms to minimize.
[2023-03-20 02:45:10] [INFO ] Deduced a trap composed of 243 places in 634 ms of which 1 ms to minimize.
[2023-03-20 02:45:10] [INFO ] Deduced a trap composed of 247 places in 620 ms of which 1 ms to minimize.
[2023-03-20 02:45:11] [INFO ] Deduced a trap composed of 246 places in 614 ms of which 1 ms to minimize.
[2023-03-20 02:45:12] [INFO ] Deduced a trap composed of 247 places in 642 ms of which 1 ms to minimize.
[2023-03-20 02:45:13] [INFO ] Deduced a trap composed of 243 places in 635 ms of which 1 ms to minimize.
[2023-03-20 02:45:14] [INFO ] Deduced a trap composed of 242 places in 640 ms of which 1 ms to minimize.
[2023-03-20 02:45:15] [INFO ] Deduced a trap composed of 246 places in 643 ms of which 0 ms to minimize.
[2023-03-20 02:45:16] [INFO ] Deduced a trap composed of 242 places in 587 ms of which 0 ms to minimize.
[2023-03-20 02:45:16] [INFO ] Deduced a trap composed of 247 places in 570 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-20 02:45:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:45:16] [INFO ] After 25541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
FORMULA TokenRing-PT-020-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TokenRing-PT-020-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 82 ms.
Support contains 74 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 389 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 38703 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38703 steps, saw 9327 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 02:45:21] [INFO ] Invariant cache hit.
[2023-03-20 02:45:21] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:45:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-20 02:45:22] [INFO ] After 1493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:45:22] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 02:45:27] [INFO ] After 4459ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 02:45:28] [INFO ] Deduced a trap composed of 248 places in 576 ms of which 1 ms to minimize.
[2023-03-20 02:45:29] [INFO ] Deduced a trap composed of 249 places in 596 ms of which 2 ms to minimize.
[2023-03-20 02:45:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1777 ms
[2023-03-20 02:45:29] [INFO ] After 7101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 738 ms.
[2023-03-20 02:45:30] [INFO ] After 9532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 73 ms.
Support contains 74 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 286 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 193 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 02:45:31] [INFO ] Invariant cache hit.
[2023-03-20 02:45:31] [INFO ] Implicit Places using invariants in 628 ms returned []
[2023-03-20 02:45:31] [INFO ] Invariant cache hit.
[2023-03-20 02:45:33] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 2240 ms to find 0 implicit places.
[2023-03-20 02:45:34] [INFO ] Redundant transitions in 1411 ms returned []
[2023-03-20 02:45:34] [INFO ] Invariant cache hit.
[2023-03-20 02:45:37] [INFO ] Dead Transitions using invariants and state equation in 2680 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6532 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 5864 edges and 441 vertex of which 351 / 441 are part of one of the 20 SCC in 9 ms
Free SCC test removed 331 places
Drop transitions removed 5852 transitions
Ensure Unique test removed 2198 transitions
Reduce isomorphic transitions removed 8050 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 110 transition count 362
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 101 transition count 359
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 98 transition count 359
Drop transitions removed 232 transitions
Redundant transition composition rules discarded 232 transitions
Iterating global reduction 3 with 232 rules applied. Total rules applied 257 place count 98 transition count 127
Applied a total of 257 rules in 41 ms. Remains 98 /441 variables (removed 343) and now considering 127/8421 (removed 8294) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 127 rows 98 cols
[2023-03-20 02:45:37] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-20 02:45:37] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:45:37] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-20 02:45:37] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:45:37] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-20 02:45:37] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 02:45:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-20 02:45:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 441 places, 8421 transitions and 33684 arcs took 34 ms.
[2023-03-20 02:45:38] [INFO ] Flatten gal took : 415 ms
Total runtime 50653 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running TokenRing (PT), instance 020
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: 441 places, 8421 transitions, 33684 arcs.
Final Score: 171625.214
Took : 96 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: TokenRing-PT-020-ReachabilityCardinality-11 (reachable &!potential( ( ( (tk(P271)) <= ( 1 ) ) & ( ( ( (! ( (tk(P75)) <= ( 0 ) )) | (! ( (tk(P135)) <= ( 1 ) )) ) | ( ( ( 1 ) <= (tk(P273)) ) | (! ( ( 1 ) <= (tk(P64)) )) ) ) | ( ( (! ( (tk(P103)) <= (tk(P240)) )) | (! ( ( 1 ) <= (tk(P270)) )) ) | ( ( ( (tk(P158)) <= ( 1 ) ) & ( ( (! ( (tk(P239)) <= (tk(P109)) )) | ( ( (tk(P290)) <= (tk(P95)) ) | ( ( 1 ) <= (tk(P18)) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P53)) )) | ( (! ( (tk(P48)) <= (tk(P86)) )) | (! ( (tk(P401)) <= ( 1 ) )) ) ) | ( (! ( (tk(P98)) <= (tk(P342)) )) | ( ( ( 1 ) <= (tk(P297)) ) | ( (! ( (tk(P17)) <= ( 0 ) )) & ( (! ( (tk(P338)) <= ( 0 ) )) & ( ( (tk(P165)) <= (tk(P137)) ) | ( ( 1 ) <= (tk(P259)) ) ) ) ) ) ) ) ) ) | ( ( (! ( (tk(P344)) <= ( 0 ) )) & ( (! ( (tk(P122)) <= ( 0 ) )) | (! ( ( 1 ) <= (tk(P355)) )) ) ) | ( ( (tk(P122)) <= (tk(P149)) ) & (! ( (tk(P368)) <= ( 0 ) )) ) ) ) ) ) )))
PROPERTY: TokenRing-PT-020-ReachabilityCardinality-12 (reachable &!potential( ( ( (! ( ( 1 ) <= (tk(P374)) )) | (! ( ( 1 ) <= (tk(P93)) )) ) | ( ( ( (! ( (tk(P146)) <= (tk(P93)) )) & ( ( (tk(P139)) <= (tk(P57)) ) & ( (tk(P312)) <= (tk(P418)) ) ) ) & ( ( (tk(P30)) <= ( 0 ) ) & ( (! ( (tk(P249)) <= ( 1 ) )) & (! ( (tk(P339)) <= ( 0 ) )) ) ) ) | ( ( (tk(P30)) <= (tk(P94)) ) & ( ( ( (tk(P382)) <= (tk(P345)) ) | ( ( ( 1 ) <= (tk(P73)) ) | ( ( ( ( 1 ) <= (tk(P356)) ) & ( (tk(P141)) <= ( 1 ) ) ) & ( ( (tk(P14)) <= (tk(P233)) ) & ( (tk(P109)) <= (tk(P211)) ) ) ) ) ) & ( ( (! ( (tk(P153)) <= (tk(P343)) )) | (! ( (tk(P63)) <= (tk(P115)) )) ) | ( ( ( ( 1 ) <= (tk(P70)) ) & ( ( ( 1 ) <= (tk(P80)) ) & ( ( ( (tk(P122)) <= ( 1 ) ) | (! ( (tk(P51)) <= ( 0 ) )) ) | ( ( (! ( (tk(P208)) <= (tk(P13)) )) & (! ( ( 1 ) <= (tk(P78)) )) ) | ( ( (! ( ( 1 ) <= (tk(P265)) )) & (! ( (tk(P441)) <= ( 0 ) )) ) | ( ( (tk(P379)) <= (tk(P106)) ) & ( (tk(P256)) <= ( 0 ) ) ) ) ) ) ) ) | ( ( ( (tk(P240)) <= (tk(P302)) ) & ( ( 1 ) <= (tk(P401)) ) ) & ( ( (! ( (tk(P239)) <= (tk(P189)) )) | ( ( (! ( ( 1 ) <= (tk(P3)) )) & (! ( (tk(P100)) <= (tk(P44)) )) ) & ( (! ( (tk(P63)) <= (tk(P411)) )) & (! ( (tk(P116)) <= (tk(P413)) )) ) ) ) & ( ( ( 1 ) <= (tk(P37)) ) | ( ( 1 ) <= (tk(P44)) ) ) ) ) ) ) ) ) ) )))
BK_STOP 1679281197602
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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: 597 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="TokenRing-PT-020"
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 TokenRing-PT-020, 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-167912710800678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-020.tgz
mv TokenRing-PT-020 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 ;