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

About the Execution of Marcie+red for RERS2020-PT-pb103

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5701.188 3600000.00 3657451.00 7500.40 F????TF??????FF? 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.r330-tall-167889203000239.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 RERS2020-PT-pb103, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203000239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.2K Feb 26 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18M 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 RERS2020-PT-pb103-ReachabilityFireability-00
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-01
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-02
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-03
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-04
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-05
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-06
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-07
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-08
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-09
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-10
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-11
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-12
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-13
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-14
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679116684983

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb103
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 05:18:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 05:18:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 05:18:07] [INFO ] Load time of PNML (sax parser for PT used): 709 ms
[2023-03-18 05:18:07] [INFO ] Transformed 520 places.
[2023-03-18 05:18:07] [INFO ] Transformed 31658 transitions.
[2023-03-18 05:18:07] [INFO ] Found NUPN structural information;
[2023-03-18 05:18:07] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 913 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 16) seen :1
FORMULA RERS2020-PT-pb103-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 35732 steps, run timeout after 3006 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35732 steps, saw 24472 distinct states, run finished after 3007 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-18 05:18:11] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2023-03-18 05:18:11] [INFO ] Computed 15 place invariants in 108 ms
[2023-03-18 05:18:12] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-18 05:18:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:18:12] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-18 05:18:20] [INFO ] After 7023ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :12
[2023-03-18 05:18:20] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-18 05:18:35] [INFO ] After 15116ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :3 sat :12
[2023-03-18 05:18:38] [INFO ] Deduced a trap composed of 50 places in 2191 ms of which 8 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-18 05:18:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 05:18:38] [INFO ] After 25568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA RERS2020-PT-pb103-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 176 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1069 rules applied. Total rules applied 1069 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 30 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1071 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 29 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1073 place count 511 transition count 27377
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 1078 place count 511 transition count 27372
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1095 place count 506 transition count 27360
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1096 place count 506 transition count 27540
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1097 place count 505 transition count 27540
Applied a total of 1097 rules in 776 ms. Remains 505 /520 variables (removed 15) and now considering 27540/28429 (removed 889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 781 ms. Remains : 505/520 places, 27540/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :1
FORMULA RERS2020-PT-pb103-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 35636 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35636 steps, saw 25174 distinct states, run finished after 3002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-18 05:18:43] [INFO ] Flow matrix only has 18793 transitions (discarded 8747 similar events)
// Phase 1: matrix 18793 rows 505 cols
[2023-03-18 05:18:43] [INFO ] Computed 8 place invariants in 83 ms
[2023-03-18 05:18:43] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:18:44] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 05:18:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 05:18:50] [INFO ] After 6478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 05:18:51] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-18 05:19:02] [INFO ] After 11634ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-18 05:19:04] [INFO ] Deduced a trap composed of 151 places in 1722 ms of which 1 ms to minimize.
[2023-03-18 05:19:06] [INFO ] Deduced a trap composed of 22 places in 1781 ms of which 2 ms to minimize.
[2023-03-18 05:19:08] [INFO ] Deduced a trap composed of 50 places in 1591 ms of which 2 ms to minimize.
[2023-03-18 05:19:11] [INFO ] Deduced a trap composed of 9 places in 2092 ms of which 2 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-18 05:19:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 05:19:11] [INFO ] After 27129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 27 ms.
Support contains 167 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 27540/27540 transitions.
Applied a total of 0 rules in 123 ms. Remains 505 /505 variables (removed 0) and now considering 27540/27540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 505/505 places, 27540/27540 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 37765 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37765 steps, saw 26550 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-18 05:19:15] [INFO ] Flow matrix only has 18793 transitions (discarded 8747 similar events)
[2023-03-18 05:19:15] [INFO ] Invariant cache hit.
[2023-03-18 05:19:15] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 05:19:15] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 05:19:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 05:19:23] [INFO ] After 7004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 05:19:23] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-18 05:19:36] [INFO ] After 13261ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-18 05:19:39] [INFO ] Deduced a trap composed of 90 places in 2117 ms of which 1 ms to minimize.
[2023-03-18 05:19:41] [INFO ] Deduced a trap composed of 34 places in 2204 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-18 05:19:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 05:19:41] [INFO ] After 25771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 27 ms.
Support contains 167 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 27540/27540 transitions.
Applied a total of 0 rules in 107 ms. Remains 505 /505 variables (removed 0) and now considering 27540/27540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 505/505 places, 27540/27540 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 27540/27540 transitions.
Applied a total of 0 rules in 98 ms. Remains 505 /505 variables (removed 0) and now considering 27540/27540 (removed 0) transitions.
[2023-03-18 05:19:41] [INFO ] Flow matrix only has 18793 transitions (discarded 8747 similar events)
[2023-03-18 05:19:41] [INFO ] Invariant cache hit.
[2023-03-18 05:19:42] [INFO ] Implicit Places using invariants in 530 ms returned []
Implicit Place search using SMT only with invariants took 532 ms to find 0 implicit places.
[2023-03-18 05:19:42] [INFO ] Flow matrix only has 18793 transitions (discarded 8747 similar events)
[2023-03-18 05:19:42] [INFO ] Invariant cache hit.
[2023-03-18 05:19:50] [INFO ] Dead Transitions using invariants and state equation in 8067 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8701 ms. Remains : 505/505 places, 27540/27540 transitions.
Graph (trivial) has 3733 edges and 505 vertex of which 202 / 505 are part of one of the 35 SCC in 4 ms
Free SCC test removed 167 places
Drop transitions removed 2926 transitions
Ensure Unique test removed 12932 transitions
Reduce isomorphic transitions removed 15858 transitions.
Graph (complete) has 8974 edges and 338 vertex of which 336 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 336 transition count 11678
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 335 transition count 11678
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 334 transition count 11677
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 40 place count 334 transition count 11646
Drop transitions removed 5851 transitions
Redundant transition composition rules discarded 5851 transitions
Iterating global reduction 3 with 5851 rules applied. Total rules applied 5891 place count 334 transition count 5795
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 6862 edges and 330 vertex of which 328 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 9 rules applied. Total rules applied 5900 place count 328 transition count 5791
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 5903 place count 328 transition count 5788
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 5906 place count 325 transition count 5785
Iterating global reduction 5 with 3 rules applied. Total rules applied 5909 place count 325 transition count 5785
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 5915 place count 325 transition count 5779
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5917 place count 324 transition count 5778
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 5925 place count 324 transition count 5770
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 5926 place count 324 transition count 5769
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 5947 place count 323 transition count 5749
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 5962 place count 323 transition count 5749
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 5972 place count 323 transition count 5739
Applied a total of 5972 rules in 1186 ms. Remains 323 /505 variables (removed 182) and now considering 5739/27540 (removed 21801) transitions.
Running SMT prover for 11 properties.
[2023-03-18 05:19:51] [INFO ] Flow matrix only has 5737 transitions (discarded 2 similar events)
// Phase 1: matrix 5737 rows 323 cols
[2023-03-18 05:19:51] [INFO ] Computed 4 place invariants in 33 ms
[2023-03-18 05:19:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 05:19:52] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 05:19:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 05:19:54] [INFO ] After 2025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 05:19:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-18 05:19:55] [INFO ] After 1121ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-18 05:19:57] [INFO ] After 3027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1127 ms.
[2023-03-18 05:19:58] [INFO ] After 6345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-18 05:19:58] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-18 05:19:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 505 places, 27540 transitions and 109615 arcs took 87 ms.
[2023-03-18 05:19:59] [INFO ] Flatten gal took : 1110 ms
Total runtime 113506 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: RERS2020_PT_pb103
(NrP: 505 NrTr: 27540 NrArc: 109615)

parse formulas
formulas created successfully
place and transition orderings generation:0m 1.795sec

net check time: 0m 0.026sec

init dd package: 0m 2.827sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10413488 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16067600 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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.826sec

1380 1506 1931 2298 2235 2343 2479 2928 2999 3160 3019 3025 2974 3189 3084 3270 3566 3713 3734 3977 4177 3725 3984 3841 4416 4415 4397 4467 4777 4972 4757 4799 4911 4340 4595 4775 4627 4686 4912 5304 5401 5142 4713 6269 6550 7130 7275 7516 7845 7945 7897 8045 9123 9279 9370 9385 9306 9628 9958 10056 10008 10156 10198 11034 11147 11015 10984 10937 10944 10941 10807 10533 11230 11343 11211 11180 11139 11140 11245 11092 10701 11144 11388 11378 11196 10925 11170 11255 11041 11134 11291 11630 11513 11352 11245 11353 11511 11409 11251 11445 11750 11722 11472 11335 11481 11630 11529 11479 10987 11432 11489 11489 11301 11387 11388 11493 11340 10953 12516 12493 12402 13199 13411 13343 13055 13028 12951 12870 12718 13394 13254 13267 13461 13419 13021 13370 13242 13106 13256 13172 13123 13457 13443 13509 13554 13609 13538 13521 13528 13391 13475 13419 13320 13184 13359 13499 13455 13488 13594 13509 13411 13471 13457 13412 13462 13263 13124 14341 14495 14537 14563 14729 15027 15188 15134 15528 15381 15750 15704 16292 16246 16199 16325 16449 16377 16281 16312 16282 16211 16304 16104 15994 16444 16376 16285 16454 16335 16314 16493 16320 16204 16374 16352 16222 15963 16221 16170 16191 16385 16250 16367 16346 16173 16284 16347 16117 16209 15943 16728 16553 16631 17021 17408 17466 17267 17455 17439 17473 17274 17093 17101 17060 16543 16366 16206 16583 16506 16285 16437 16452 16301 16643 16417 16581 16529 16414 16509 16174 16571 16511 16290 16450 16440 16289 16429 16632 16394 16430 16523 16446 16198 16607 16479 16343 16498 16513 16362 16458 16519 16505 16459 16510 16437 16177 17048 17087 17327 17357 17333 17257 17060 16661 16542 16526 16475

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="RERS2020-PT-pb103"
export BK_EXAMINATION="ReachabilityFireability"
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 RERS2020-PT-pb103, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203000239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb103.tgz
mv RERS2020-PT-pb103 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;