fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r170-tall-167838857200422
Last Updated
May 14, 2023

About the Execution of Marcie+red for FamilyReunion-PT-L00100M0010C005P005G002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9593.979 993573.00 1084298.00 2870.10 ?T?TT?FFFFTT???? 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.r170-tall-167838857200422.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 marciexred
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857200422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 290K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Feb 26 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Feb 26 12:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 170K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 700K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 327K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 869K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Feb 26 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.8M Feb 26 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17M Mar 5 18:22 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 FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678542370092

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00100M0010C005P005G002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 13:46:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 13:46:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 13:46:12] [INFO ] Load time of PNML (sax parser for PT used): 899 ms
[2023-03-11 13:46:12] [INFO ] Transformed 40605 places.
[2023-03-11 13:46:13] [INFO ] Transformed 36871 transitions.
[2023-03-11 13:46:13] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 1365 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18604 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 31 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2068 ms. (steps per millisecond=4 ) properties (out of 16) seen :3
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4196 ms. (steps per millisecond=2 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3691 ms. (steps per millisecond=2 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1894 ms. (steps per millisecond=5 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4219 ms. (steps per millisecond=2 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 879 ms. (steps per millisecond=11 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 36871 rows 40574 cols
[2023-03-11 13:46:55] [INFO ] Computed 8805 place invariants in 5140 ms
[2023-03-11 13:47:08] [INFO ] After 13035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 13:47:21] [INFO ] [Nat]Absence check using 300 positive place invariants in 950 ms returned sat
[2023-03-11 13:47:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 13:47:33] [INFO ] [Nat]Absence check using 300 positive and 8505 generalized place invariants in 11378 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: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-11 13:47:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 13:47:33] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 35732 out of 40574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Graph (complete) has 65258 edges and 40574 vertex of which 40568 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.64 ms
Discarding 6 places :
Also discarding 0 output transitions
Discarding 1109 places :
Implicit places reduction removed 1109 places
Iterating post reduction 0 with 1109 rules applied. Total rules applied 1110 place count 39459 transition count 36871
Discarding 1510 places :
Symmetric choice reduction at 1 with 1510 rule applications. Total rules 2620 place count 37949 transition count 35361
Iterating global reduction 1 with 1510 rules applied. Total rules applied 4130 place count 37949 transition count 35361
Applied a total of 4130 rules in 1618 ms. Remains 37949 /40574 variables (removed 2625) and now considering 35361/36871 (removed 1510) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1624 ms. Remains : 37949/40574 places, 35361/36871 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1262 ms. (steps per millisecond=7 ) properties (out of 13) seen :4
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4165 ms. (steps per millisecond=2 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1897 ms. (steps per millisecond=5 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 887 ms. (steps per millisecond=11 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 35361 rows 37949 cols
[2023-03-11 13:47:47] [INFO ] Computed 7690 place invariants in 3569 ms
[2023-03-11 13:47:57] [INFO ] After 9674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 13:48:07] [INFO ] [Nat]Absence check using 300 positive place invariants in 688 ms returned sat
[2023-03-11 13:48:16] [INFO ] [Nat]Absence check using 300 positive and 7390 generalized place invariants in 9632 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-11 13:48:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 13:48:22] [INFO ] After 25092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26870 out of 37949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37949/37949 places, 35361/35361 transitions.
Graph (complete) has 61524 edges and 37949 vertex of which 37842 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.31 ms
Discarding 107 places :
Also discarding 0 output transitions
Discarding 1109 places :
Implicit places reduction removed 1109 places
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 1707 rules applied. Total rules applied 1708 place count 36733 transition count 34763
Reduce places removed 598 places and 0 transitions.
Performed 1102 Post agglomeration using F-continuation condition.Transition count delta: 1102
Iterating post reduction 1 with 1700 rules applied. Total rules applied 3408 place count 36135 transition count 33661
Reduce places removed 1102 places and 0 transitions.
Iterating post reduction 2 with 1102 rules applied. Total rules applied 4510 place count 35033 transition count 33661
Performed 603 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 603 Pre rules applied. Total rules applied 4510 place count 35033 transition count 33058
Deduced a syphon composed of 603 places in 38 ms
Reduce places removed 603 places and 0 transitions.
Iterating global reduction 3 with 1206 rules applied. Total rules applied 5716 place count 34430 transition count 33058
Discarding 600 places :
Implicit places reduction removed 600 places
Iterating post reduction 3 with 600 rules applied. Total rules applied 6316 place count 33830 transition count 33058
Discarding 706 places :
Symmetric choice reduction at 4 with 706 rule applications. Total rules 7022 place count 33124 transition count 32352
Iterating global reduction 4 with 706 rules applied. Total rules applied 7728 place count 33124 transition count 32352
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 98 Pre rules applied. Total rules applied 7728 place count 33124 transition count 32254
Deduced a syphon composed of 98 places in 36 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 7924 place count 33026 transition count 32254
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 38 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 8122 place count 32927 transition count 32155
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 8132 place count 32927 transition count 32145
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 8142 place count 32917 transition count 32145
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 8143 place count 32917 transition count 32145
Applied a total of 8143 rules in 9160 ms. Remains 32917 /37949 variables (removed 5032) and now considering 32145/35361 (removed 3216) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9160 ms. Remains : 32917/37949 places, 32145/35361 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=9 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4148 ms. (steps per millisecond=2 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1888 ms. (steps per millisecond=5 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 887 ms. (steps per millisecond=11 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) 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 9) 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 9) 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 9) seen :0
Interrupted probabilistic random walk after 301784 steps, run timeout after 24005 ms. (steps per millisecond=12 ) properties seen :{4=1}
Probabilistic random walk after 301784 steps, saw 298832 distinct states, run finished after 24006 ms. (steps per millisecond=12 ) properties seen :1
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 8 properties.
// Phase 1: matrix 32145 rows 32917 cols
[2023-03-11 13:49:06] [INFO ] Computed 5879 place invariants in 2321 ms
[2023-03-11 13:49:14] [INFO ] After 7982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 13:49:23] [INFO ] [Nat]Absence check using 303 positive place invariants in 890 ms returned sat
[2023-03-11 13:49:29] [INFO ] [Nat]Absence check using 303 positive and 5576 generalized place invariants in 6333 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-11 13:49:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 13:49:39] [INFO ] After 25165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26846 out of 32917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32917/32917 places, 32145/32145 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
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 4 rules applied. Total rules applied 4 place count 32914 transition count 32144
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 32913 transition count 32140
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13 place count 32909 transition count 32140
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 13 place count 32909 transition count 32134
Deduced a syphon composed of 6 places in 35 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 25 place count 32903 transition count 32134
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 27 place count 32901 transition count 32134
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 27 place count 32901 transition count 32132
Deduced a syphon composed of 2 places in 37 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 31 place count 32899 transition count 32132
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 34 place count 32896 transition count 32129
Iterating global reduction 4 with 3 rules applied. Total rules applied 37 place count 32896 transition count 32129
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 32896 transition count 32128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 39 place count 32895 transition count 32128
Applied a total of 39 rules in 4438 ms. Remains 32895 /32917 variables (removed 22) and now considering 32128/32145 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4438 ms. Remains : 32895/32917 places, 32128/32145 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1029 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4153 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1878 ms. (steps per millisecond=5 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 881 ms. (steps per millisecond=11 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) 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 8) 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 8) seen :0
Interrupted probabilistic random walk after 278950 steps, run timeout after 24008 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 278950 steps, saw 276223 distinct states, run finished after 24009 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 32128 rows 32895 cols
[2023-03-11 13:50:18] [INFO ] Computed 5874 place invariants in 2353 ms
[2023-03-11 13:50:26] [INFO ] After 7784ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 13:50:34] [INFO ] [Nat]Absence check using 300 positive place invariants in 725 ms returned sat
[2023-03-11 13:50:42] [INFO ] [Nat]Absence check using 300 positive and 5574 generalized place invariants in 7800 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-11 13:50:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 13:50:51] [INFO ] After 25091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26846 out of 32895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32895/32895 places, 32128/32128 transitions.
Applied a total of 0 rules in 1268 ms. Remains 32895 /32895 variables (removed 0) and now considering 32128/32128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1270 ms. Remains : 32895/32895 places, 32128/32128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32895/32895 places, 32128/32128 transitions.
Applied a total of 0 rules in 1229 ms. Remains 32895 /32895 variables (removed 0) and now considering 32128/32128 (removed 0) transitions.
[2023-03-11 13:50:54] [INFO ] Invariant cache hit.
[2023-03-11 13:50:56] [INFO ] Implicit Places using invariants in 2520 ms returned []
Implicit Place search using SMT only with invariants took 2521 ms to find 0 implicit places.
[2023-03-11 13:50:56] [INFO ] Invariant cache hit.
[2023-03-11 13:50:59] [INFO ] Dead Transitions using invariants and state equation in 2537 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6298 ms. Remains : 32895/32895 places, 32128/32128 transitions.
Applied a total of 0 rules in 1236 ms. Remains 32895 /32895 variables (removed 0) and now considering 32128/32128 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-03-11 13:51:00] [INFO ] Invariant cache hit.
[2023-03-11 13:51:08] [INFO ] After 7849ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 13:51:16] [INFO ] [Nat]Absence check using 300 positive place invariants in 581 ms returned sat
[2023-03-11 13:51:21] [INFO ] [Nat]Absence check using 300 positive and 5574 generalized place invariants in 5193 ms returned sat
[2023-03-11 13:54:33] [INFO ] After 168452ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-11 13:54:53] [INFO ] After 189031ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 13:54:53] [INFO ] After 225282ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2023-03-11 13:54:53] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 27 ms.
[2023-03-11 13:54:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32895 places, 32128 transitions and 88090 arcs took 98 ms.
[2023-03-11 13:54:55] [INFO ] Flatten gal took : 1269 ms
Total runtime 523950 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FamilyReunion_PT_L00100M0010C005P005G002
(NrP: 32895 NrTr: 32128 NrArc: 88090)

parse formulas
formulas created successfully
place and transition orderings generation:3m 1.626sec

net check time: 0m 0.019sec

init dd package: 0m 2.516sec


before gc: list nodes free: 1915754

after gc: idd nodes used:11314, unused:63988686; list nodes free:257870498

before gc: list nodes free: 1735699

after gc: idd nodes used:15999, unused:63984001; list nodes free:257837561

before gc: list nodes free: 1617202

after gc: idd nodes used:19594, unused:63980406; list nodes free:257812380

before gc: list nodes free: 1642217

after gc: idd nodes used:22624, unused:63977376; list nodes free:257791170

before gc: list nodes free: 1662723

after gc: idd nodes used:25294, unused:63974706; list nodes free:257772480

before gc: list nodes free: 1674685

after gc: idd nodes used:27708, unused:63972292; list nodes free:257755576

before gc: list nodes free: 1667646

after gc: idd nodes used:29927, unused:63970073; list nodes free:257740025

before gc: list nodes free: 1656328

after gc: idd nodes used:31993, unused:63968007; list nodes free:257725545

BK_STOP 1678543363665

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 4.660sec

/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 516 Segmentation fault ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="FamilyReunion-PT-L00100M0010C005P005G002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is FamilyReunion-PT-L00100M0010C005P005G002, 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 r170-tall-167838857200422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00100M0010C005P005G002.tgz
mv FamilyReunion-PT-L00100M0010C005P005G002 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;