About the Execution of Marcie+red for CANConstruction-PT-100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9685.896 | 3600000.00 | 3684686.00 | 802.60 | T??????????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696100690.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANConstruction-PT-100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100690
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.6K Feb 25 22:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 22:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 22:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 22:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 15M 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 CANConstruction-PT-100-CTLFireability-00
FORMULA_NAME CANConstruction-PT-100-CTLFireability-01
FORMULA_NAME CANConstruction-PT-100-CTLFireability-02
FORMULA_NAME CANConstruction-PT-100-CTLFireability-03
FORMULA_NAME CANConstruction-PT-100-CTLFireability-04
FORMULA_NAME CANConstruction-PT-100-CTLFireability-05
FORMULA_NAME CANConstruction-PT-100-CTLFireability-06
FORMULA_NAME CANConstruction-PT-100-CTLFireability-07
FORMULA_NAME CANConstruction-PT-100-CTLFireability-08
FORMULA_NAME CANConstruction-PT-100-CTLFireability-09
FORMULA_NAME CANConstruction-PT-100-CTLFireability-10
FORMULA_NAME CANConstruction-PT-100-CTLFireability-11
FORMULA_NAME CANConstruction-PT-100-CTLFireability-12
FORMULA_NAME CANConstruction-PT-100-CTLFireability-13
FORMULA_NAME CANConstruction-PT-100-CTLFireability-14
FORMULA_NAME CANConstruction-PT-100-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678742193807
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:16:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 21:16:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:16:36] [INFO ] Load time of PNML (sax parser for PT used): 730 ms
[2023-03-13 21:16:36] [INFO ] Transformed 21202 places.
[2023-03-13 21:16:36] [INFO ] Transformed 40800 transitions.
[2023-03-13 21:16:36] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 974 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Support contains 160 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 191 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-13 21:16:37] [INFO ] Computed 201 place invariants in 648 ms
[2023-03-13 21:16:40] [INFO ] Implicit Places using invariants in 3119 ms returned []
Implicit Place search using SMT only with invariants took 3147 ms to find 0 implicit places.
[2023-03-13 21:16:40] [INFO ] Invariant cache hit.
[2023-03-13 21:16:42] [INFO ] Dead Transitions using invariants and state equation in 2221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5568 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Support contains 160 out of 21202 places after structural reductions.
[2023-03-13 21:16:43] [INFO ] Flatten gal took : 1096 ms
[2023-03-13 21:16:44] [INFO ] Flatten gal took : 877 ms
[2023-03-13 21:16:46] [INFO ] Input system was already deterministic with 40800 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1013 ms. (steps per millisecond=9 ) properties (out of 87) seen :39
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Running SMT prover for 48 properties.
[2023-03-13 21:16:48] [INFO ] Invariant cache hit.
[2023-03-13 21:17:06] [INFO ] [Real]Absence check using 101 positive place invariants in 487 ms returned sat
[2023-03-13 21:17:06] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 189 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-13 21:17:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:17:13] [INFO ] After 25129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 48 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 91 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 670 transitions
Trivial Post-agglo rules discarded 670 transitions
Performed 670 trivial Post agglomeration. Transition count delta: 670
Iterating post reduction 0 with 670 rules applied. Total rules applied 670 place count 21202 transition count 40130
Reduce places removed 670 places and 0 transitions.
Iterating post reduction 1 with 670 rules applied. Total rules applied 1340 place count 20532 transition count 40130
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1340 place count 20532 transition count 40121
Deduced a syphon composed of 9 places in 18 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1358 place count 20523 transition count 40121
Performed 9946 Post agglomeration using F-continuation condition.Transition count delta: 9946
Deduced a syphon composed of 9946 places in 18 ms
Reduce places removed 9946 places and 0 transitions.
Iterating global reduction 2 with 19892 rules applied. Total rules applied 21250 place count 10577 transition count 30175
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 2 with 21 rules applied. Total rules applied 21271 place count 10577 transition count 30154
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 21292 place count 10556 transition count 30154
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 21301 place count 10556 transition count 30154
Applied a total of 21301 rules in 6411 ms. Remains 10556 /21202 variables (removed 10646) and now considering 30154/40800 (removed 10646) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6416 ms. Remains : 10556/21202 places, 30154/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 48) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
// Phase 1: matrix 30154 rows 10556 cols
[2023-03-13 21:17:21] [INFO ] Computed 201 place invariants in 291 ms
[2023-03-13 21:17:28] [INFO ] [Real]Absence check using 101 positive place invariants in 344 ms returned sat
[2023-03-13 21:17:29] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 149 ms returned sat
[2023-03-13 21:17:46] [INFO ] After 10382ms SMT Verify possible using state equation in real domain returned unsat :0 sat :15 real:12
[2023-03-13 21:17:46] [INFO ] State equation strengthened by 29855 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-13 21:17:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:17:46] [INFO ] After 25330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 34 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 72 out of 10556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10556/10556 places, 30154/30154 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 10544 transition count 30142
Applied a total of 24 rules in 262 ms. Remains 10544 /10556 variables (removed 12) and now considering 30142/30154 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 10544/10556 places, 30142/30154 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 34) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 30142 rows 10544 cols
[2023-03-13 21:17:47] [INFO ] Computed 201 place invariants in 243 ms
[2023-03-13 21:17:53] [INFO ] [Real]Absence check using 101 positive place invariants in 262 ms returned sat
[2023-03-13 21:17:54] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 147 ms returned sat
[2023-03-13 21:18:12] [INFO ] After 13280ms SMT Verify possible using state equation in real domain returned unsat :0 sat :23 real:4
[2023-03-13 21:18:13] [INFO ] State equation strengthened by 29866 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-13 21:18:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:18:13] [INFO ] After 25269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 63 out of 10544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10544/10544 places, 30142/30142 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 10539 transition count 30137
Applied a total of 10 rules in 248 ms. Remains 10539 /10544 variables (removed 5) and now considering 30137/30142 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 10539/10544 places, 30137/30142 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 28) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 30137 rows 10539 cols
[2023-03-13 21:18:14] [INFO ] Computed 201 place invariants in 291 ms
[2023-03-13 21:18:19] [INFO ] [Real]Absence check using 101 positive place invariants in 298 ms returned sat
[2023-03-13 21:18:20] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 187 ms returned sat
[2023-03-13 21:18:39] [INFO ] After 14471ms SMT Verify possible using state equation in real domain returned unsat :0 sat :20 real:3
[2023-03-13 21:18:39] [INFO ] State equation strengthened by 29871 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-13 21:18:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:18:39] [INFO ] After 25452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 56 out of 10539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10539/10539 places, 30137/30137 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 10536 transition count 30134
Applied a total of 6 rules in 334 ms. Remains 10536 /10539 variables (removed 3) and now considering 30134/30137 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 10536/10539 places, 30134/30137 transitions.
[2023-03-13 21:18:41] [INFO ] Flatten gal took : 797 ms
[2023-03-13 21:18:41] [INFO ] Flatten gal took : 949 ms
[2023-03-13 21:18:43] [INFO ] Input system was already deterministic with 40800 transitions.
Computed a total of 401 stabilizing places and 500 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 10 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1596 place count 20404 transition count 40002
Applied a total of 1596 rules in 952 ms. Remains 20404 /21202 variables (removed 798) and now considering 40002/40800 (removed 798) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 954 ms. Remains : 20404/21202 places, 40002/40800 transitions.
[2023-03-13 21:18:45] [INFO ] Flatten gal took : 648 ms
[2023-03-13 21:18:46] [INFO ] Flatten gal took : 731 ms
[2023-03-13 21:18:47] [INFO ] Input system was already deterministic with 40002 transitions.
Finished random walk after 3880 steps, including 4 resets, run visited all 1 properties in 223 ms. (steps per millisecond=17 )
FORMULA CANConstruction-PT-100-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 146 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 21202/21202 places, 40800/40800 transitions.
[2023-03-13 21:18:49] [INFO ] Flatten gal took : 718 ms
[2023-03-13 21:18:49] [INFO ] Flatten gal took : 804 ms
[2023-03-13 21:18:51] [INFO ] Input system was already deterministic with 40800 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 133 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 21202/21202 places, 40800/40800 transitions.
[2023-03-13 21:18:52] [INFO ] Flatten gal took : 786 ms
[2023-03-13 21:18:53] [INFO ] Flatten gal took : 708 ms
[2023-03-13 21:18:54] [INFO ] Input system was already deterministic with 40800 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 691 transitions
Trivial Post-agglo rules discarded 691 transitions
Performed 691 trivial Post agglomeration. Transition count delta: 691
Iterating post reduction 0 with 691 rules applied. Total rules applied 691 place count 21202 transition count 40109
Reduce places removed 691 places and 0 transitions.
Iterating post reduction 1 with 691 rules applied. Total rules applied 1382 place count 20511 transition count 40109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1382 place count 20511 transition count 40104
Deduced a syphon composed of 5 places in 10 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1392 place count 20506 transition count 40104
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 9 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 1582 place count 20411 transition count 40009
Applied a total of 1582 rules in 829 ms. Remains 20411 /21202 variables (removed 791) and now considering 40009/40800 (removed 791) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 829 ms. Remains : 20411/21202 places, 40009/40800 transitions.
[2023-03-13 21:18:56] [INFO ] Flatten gal took : 625 ms
[2023-03-13 21:18:57] [INFO ] Flatten gal took : 782 ms
[2023-03-13 21:18:58] [INFO ] Input system was already deterministic with 40009 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21202 transition count 40100
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20502 transition count 40100
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 9 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1600 place count 20402 transition count 40000
Applied a total of 1600 rules in 649 ms. Remains 20402 /21202 variables (removed 800) and now considering 40000/40800 (removed 800) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 650 ms. Remains : 20402/21202 places, 40000/40800 transitions.
[2023-03-13 21:19:00] [INFO ] Flatten gal took : 629 ms
[2023-03-13 21:19:00] [INFO ] Flatten gal took : 704 ms
[2023-03-13 21:19:02] [INFO ] Input system was already deterministic with 40000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 110 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 21202/21202 places, 40800/40800 transitions.
[2023-03-13 21:19:03] [INFO ] Flatten gal took : 647 ms
[2023-03-13 21:19:03] [INFO ] Flatten gal took : 731 ms
[2023-03-13 21:19:05] [INFO ] Input system was already deterministic with 40800 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 694 transitions
Trivial Post-agglo rules discarded 694 transitions
Performed 694 trivial Post agglomeration. Transition count delta: 694
Iterating post reduction 0 with 694 rules applied. Total rules applied 694 place count 21202 transition count 40106
Reduce places removed 694 places and 0 transitions.
Iterating post reduction 1 with 694 rules applied. Total rules applied 1388 place count 20508 transition count 40106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1388 place count 20508 transition count 40104
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1392 place count 20506 transition count 40104
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 12 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 1588 place count 20408 transition count 40006
Applied a total of 1588 rules in 799 ms. Remains 20408 /21202 variables (removed 794) and now considering 40006/40800 (removed 794) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 800 ms. Remains : 20408/21202 places, 40006/40800 transitions.
[2023-03-13 21:19:07] [INFO ] Flatten gal took : 665 ms
[2023-03-13 21:19:08] [INFO ] Flatten gal took : 720 ms
[2023-03-13 21:19:09] [INFO ] Input system was already deterministic with 40006 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 121 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 21202/21202 places, 40800/40800 transitions.
[2023-03-13 21:19:10] [INFO ] Flatten gal took : 647 ms
[2023-03-13 21:19:11] [INFO ] Flatten gal took : 730 ms
[2023-03-13 21:19:12] [INFO ] Input system was already deterministic with 40800 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1396 place count 20504 transition count 40101
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 8 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 1596 place count 20404 transition count 40002
Applied a total of 1596 rules in 726 ms. Remains 20404 /21202 variables (removed 798) and now considering 40002/40800 (removed 798) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 726 ms. Remains : 20404/21202 places, 40002/40800 transitions.
[2023-03-13 21:19:14] [INFO ] Flatten gal took : 622 ms
[2023-03-13 21:19:14] [INFO ] Flatten gal took : 702 ms
[2023-03-13 21:19:16] [INFO ] Input system was already deterministic with 40002 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 692 transitions
Trivial Post-agglo rules discarded 692 transitions
Performed 692 trivial Post agglomeration. Transition count delta: 692
Iterating post reduction 0 with 692 rules applied. Total rules applied 692 place count 21202 transition count 40108
Reduce places removed 692 places and 0 transitions.
Iterating post reduction 1 with 692 rules applied. Total rules applied 1384 place count 20510 transition count 40108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1384 place count 20510 transition count 40105
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1390 place count 20507 transition count 40105
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 9 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 1584 place count 20410 transition count 40008
Applied a total of 1584 rules in 744 ms. Remains 20410 /21202 variables (removed 792) and now considering 40008/40800 (removed 792) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 745 ms. Remains : 20410/21202 places, 40008/40800 transitions.
[2023-03-13 21:19:17] [INFO ] Flatten gal took : 633 ms
[2023-03-13 21:19:18] [INFO ] Flatten gal took : 797 ms
[2023-03-13 21:19:19] [INFO ] Input system was already deterministic with 40008 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 129 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 21202/21202 places, 40800/40800 transitions.
[2023-03-13 21:19:20] [INFO ] Flatten gal took : 686 ms
[2023-03-13 21:19:21] [INFO ] Flatten gal took : 723 ms
[2023-03-13 21:19:23] [INFO ] Input system was already deterministic with 40800 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1396 place count 20504 transition count 40101
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 11 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 1596 place count 20404 transition count 40002
Applied a total of 1596 rules in 921 ms. Remains 20404 /21202 variables (removed 798) and now considering 40002/40800 (removed 798) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 921 ms. Remains : 20404/21202 places, 40002/40800 transitions.
[2023-03-13 21:19:24] [INFO ] Flatten gal took : 665 ms
[2023-03-13 21:19:25] [INFO ] Flatten gal took : 722 ms
[2023-03-13 21:19:27] [INFO ] Input system was already deterministic with 40002 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 21202 transition count 40101
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 10 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 1598 place count 20403 transition count 40001
Applied a total of 1598 rules in 750 ms. Remains 20403 /21202 variables (removed 799) and now considering 40001/40800 (removed 799) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 752 ms. Remains : 20403/21202 places, 40001/40800 transitions.
[2023-03-13 21:19:28] [INFO ] Flatten gal took : 632 ms
[2023-03-13 21:19:29] [INFO ] Flatten gal took : 715 ms
[2023-03-13 21:19:31] [INFO ] Input system was already deterministic with 40001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 126 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 21202/21202 places, 40800/40800 transitions.
[2023-03-13 21:19:32] [INFO ] Flatten gal took : 905 ms
[2023-03-13 21:19:33] [INFO ] Flatten gal took : 773 ms
[2023-03-13 21:19:34] [INFO ] Input system was already deterministic with 40800 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 690 transitions
Trivial Post-agglo rules discarded 690 transitions
Performed 690 trivial Post agglomeration. Transition count delta: 690
Iterating post reduction 0 with 690 rules applied. Total rules applied 690 place count 21202 transition count 40110
Reduce places removed 690 places and 0 transitions.
Iterating post reduction 1 with 690 rules applied. Total rules applied 1380 place count 20512 transition count 40110
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1380 place count 20512 transition count 40106
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1388 place count 20508 transition count 40106
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 10 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 1580 place count 20412 transition count 40010
Applied a total of 1580 rules in 789 ms. Remains 20412 /21202 variables (removed 790) and now considering 40010/40800 (removed 790) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 791 ms. Remains : 20412/21202 places, 40010/40800 transitions.
[2023-03-13 21:19:36] [INFO ] Flatten gal took : 693 ms
[2023-03-13 21:19:37] [INFO ] Flatten gal took : 788 ms
[2023-03-13 21:19:38] [INFO ] Input system was already deterministic with 40010 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 109 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 21202/21202 places, 40800/40800 transitions.
[2023-03-13 21:19:39] [INFO ] Flatten gal took : 811 ms
[2023-03-13 21:19:40] [INFO ] Flatten gal took : 816 ms
[2023-03-13 21:19:41] [INFO ] Input system was already deterministic with 40800 transitions.
[2023-03-13 21:19:42] [INFO ] Flatten gal took : 817 ms
[2023-03-13 21:19:43] [INFO ] Flatten gal took : 740 ms
[2023-03-13 21:19:43] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 21:19:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21202 places, 40800 transitions and 122000 arcs took 103 ms.
Total runtime 188131 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 21202 NrTr: 40800 NrArc: 122000)
parse formulas
formulas created successfully
place and transition orderings generation:1m25.440sec
net check time: 0m 0.022sec
init dd package: 0m 2.779sec
before gc: list nodes free: 1915754
after gc: idd nodes used:11314, unused:63988686; list nodes free:257870498
before gc: list nodes free: 1901699
after gc: idd nodes used:15999, unused:63984001; list nodes free:257837703
before gc: list nodes free: 1890914
after gc: idd nodes used:19594, unused:63980406; list nodes free:257812538
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6419892 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16061560 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//
++ 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 CTLFireability -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.230sec
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="CANConstruction-PT-100"
export BK_EXAMINATION="CTLFireability"
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 CANConstruction-PT-100, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696100690"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-100.tgz
mv CANConstruction-PT-100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;