About the Execution of Smart+red for CANInsertWithFailure-PT-090
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4596.271 | 846569.00 | 923014.00 | 318.10 | TFF???TT?F?T??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.r043-tajo-167813697300775.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 smartxred
Input is CANInsertWithFailure-PT-090, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697300775
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 00:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 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 49M 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 CANInsertWithFailure-PT-090-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678805378588
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-090
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 14:49:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 14:49:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:49:42] [INFO ] Load time of PNML (sax parser for PT used): 1402 ms
[2023-03-14 14:49:42] [INFO ] Transformed 17284 places.
[2023-03-14 14:49:42] [INFO ] Transformed 49140 transitions.
[2023-03-14 14:49:42] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 1702 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 793 ms. (steps per millisecond=12 ) properties (out of 16) seen :5
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 49140 rows 17284 cols
[2023-03-14 14:49:58] [INFO ] Computed 93 place invariants in 14320 ms
[2023-03-14 14:50:04] [INFO ] [Real]Absence check using 91 positive place invariants in 250 ms returned sat
[2023-03-14 14:50:04] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 463 ms returned sat
[2023-03-14 14:50:06] [INFO ] After 8183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-14 14:50:12] [INFO ] [Nat]Absence check using 91 positive place invariants in 260 ms returned sat
[2023-03-14 14:50:12] [INFO ] [Nat]Absence check using 91 positive and 2 generalized place invariants in 483 ms returned sat
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:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 14:50:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:50:31] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 168 out of 17284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Graph (complete) has 66151 edges and 17284 vertex of which 17283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.66 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 577 transitions
Trivial Post-agglo rules discarded 577 transitions
Performed 577 trivial Post agglomeration. Transition count delta: 577
Iterating post reduction 0 with 577 rules applied. Total rules applied 578 place count 17283 transition count 48563
Reduce places removed 577 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 580 rules applied. Total rules applied 1158 place count 16706 transition count 48560
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1161 place count 16703 transition count 48560
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1161 place count 16703 transition count 48543
Deduced a syphon composed of 17 places in 18 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1195 place count 16686 transition count 48543
Performed 7836 Post agglomeration using F-continuation condition.Transition count delta: 7836
Deduced a syphon composed of 7836 places in 71 ms
Reduce places removed 7836 places and 0 transitions.
Iterating global reduction 3 with 15672 rules applied. Total rules applied 16867 place count 8850 transition count 40707
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 3 with 30 rules applied. Total rules applied 16897 place count 8850 transition count 40677
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 16927 place count 8820 transition count 40677
Partial Free-agglomeration rule applied 8244 times.
Drop transitions removed 8244 transitions
Iterating global reduction 4 with 8244 rules applied. Total rules applied 25171 place count 8820 transition count 40677
Partial Free-agglomeration rule applied 1500 times.
Drop transitions removed 1500 transitions
Iterating global reduction 4 with 1500 rules applied. Total rules applied 26671 place count 8820 transition count 40677
Applied a total of 26671 rules in 27026 ms. Remains 8820 /17284 variables (removed 8464) and now considering 40677/49140 (removed 8463) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27036 ms. Remains : 8820/17284 places, 40677/49140 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 665 ms. (steps per millisecond=15 ) properties (out of 11) seen :2
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-14 14:50:59] [INFO ] Flow matrix only has 40632 transitions (discarded 45 similar events)
// Phase 1: matrix 40632 rows 8820 cols
[2023-03-14 14:51:02] [INFO ] Computed 92 place invariants in 3214 ms
[2023-03-14 14:51:05] [INFO ] [Real]Absence check using 90 positive place invariants in 128 ms returned sat
[2023-03-14 14:51:05] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 180 ms returned sat
[2023-03-14 14:51:27] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 14:51:30] [INFO ] [Nat]Absence check using 90 positive place invariants in 132 ms returned sat
[2023-03-14 14:51:30] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 176 ms returned sat
[2023-03-14 14:51:53] [INFO ] After 21212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-14 14:51:53] [INFO ] State equation strengthened by 39644 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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 14:51:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:51:53] [INFO ] After 25459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 151 out of 8820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8820/8820 places, 40677/40677 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 9 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 8808 transition count 40665
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 8808 transition count 40665
Applied a total of 28 rules in 9679 ms. Remains 8808 /8820 variables (removed 12) and now considering 40665/40677 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9679 ms. Remains : 8808/8820 places, 40665/40677 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-14 14:52:04] [INFO ] Flow matrix only has 40624 transitions (discarded 41 similar events)
// Phase 1: matrix 40624 rows 8808 cols
[2023-03-14 14:52:07] [INFO ] Computed 92 place invariants in 3650 ms
[2023-03-14 14:52:10] [INFO ] [Real]Absence check using 90 positive place invariants in 139 ms returned sat
[2023-03-14 14:52:10] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 187 ms returned sat
[2023-03-14 14:52:32] [INFO ] After 21856ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-14 14:52:33] [INFO ] State equation strengthened by 39674 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.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 14:52:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:52:33] [INFO ] After 25529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 149 out of 8808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8808/8808 places, 40665/40665 transitions.
Partial Free-agglomeration rule applied 179 times.
Drop transitions removed 179 transitions
Iterating global reduction 0 with 179 rules applied. Total rules applied 179 place count 8808 transition count 40665
Applied a total of 179 rules in 6171 ms. Remains 8808 /8808 variables (removed 0) and now considering 40665/40665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6172 ms. Remains : 8808/8808 places, 40665/40665 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 823 ms. (steps per millisecond=12 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 66074 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66074 steps, saw 63294 distinct states, run finished after 3010 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-14 14:52:43] [INFO ] Flow matrix only has 40624 transitions (discarded 41 similar events)
// Phase 1: matrix 40624 rows 8808 cols
[2023-03-14 14:52:46] [INFO ] Computed 92 place invariants in 3263 ms
[2023-03-14 14:52:48] [INFO ] [Real]Absence check using 90 positive place invariants in 128 ms returned sat
[2023-03-14 14:52:49] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 173 ms returned sat
[2023-03-14 14:53:11] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 14:53:14] [INFO ] [Nat]Absence check using 90 positive place invariants in 129 ms returned sat
[2023-03-14 14:53:14] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 168 ms returned sat
[2023-03-14 14:53:36] [INFO ] After 21210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 14:53:37] [INFO ] State equation strengthened by 39851 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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 14:53:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:53:37] [INFO ] After 25401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 149 out of 8808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8808/8808 places, 40665/40665 transitions.
Applied a total of 0 rules in 3087 ms. Remains 8808 /8808 variables (removed 0) and now considering 40665/40665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3088 ms. Remains : 8808/8808 places, 40665/40665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8808/8808 places, 40665/40665 transitions.
Applied a total of 0 rules in 3089 ms. Remains 8808 /8808 variables (removed 0) and now considering 40665/40665 (removed 0) transitions.
[2023-03-14 14:53:43] [INFO ] Flow matrix only has 40624 transitions (discarded 41 similar events)
[2023-03-14 14:53:43] [INFO ] Invariant cache hit.
[2023-03-14 14:53:44] [INFO ] Implicit Places using invariants in 1020 ms returned []
Implicit Place search using SMT only with invariants took 1021 ms to find 0 implicit places.
[2023-03-14 14:53:44] [INFO ] Flow matrix only has 40624 transitions (discarded 41 similar events)
[2023-03-14 14:53:44] [INFO ] Invariant cache hit.
[2023-03-14 14:53:45] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5238 ms. Remains : 8808/8808 places, 40665/40665 transitions.
Graph (trivial) has 36664 edges and 8808 vertex of which 6703 / 8808 are part of one of the 1 SCC in 16 ms
Free SCC test removed 6702 places
Drop transitions removed 24973 transitions
Ensure Unique test removed 7761 transitions
Reduce isomorphic transitions removed 32734 transitions.
Graph (complete) has 8578 edges and 2106 vertex of which 1921 are kept as prefixes of interest. Removing 185 places using SCC suffix rule.3 ms
Discarding 185 places :
Also discarding 61 output transitions
Drop transitions removed 61 transitions
Drop transitions removed 1065 transitions
Reduce isomorphic transitions removed 1065 transitions.
Iterating post reduction 0 with 1065 rules applied. Total rules applied 1067 place count 1921 transition count 6805
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 1067 place count 1921 transition count 6795
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1087 place count 1911 transition count 6795
Discarding 1201 places :
Symmetric choice reduction at 1 with 1201 rule applications. Total rules 2288 place count 710 transition count 3094
Iterating global reduction 1 with 1201 rules applied. Total rules applied 3489 place count 710 transition count 3094
Ensure Unique test removed 998 transitions
Reduce isomorphic transitions removed 998 transitions.
Iterating post reduction 1 with 998 rules applied. Total rules applied 4487 place count 710 transition count 2096
Discarding 143 places :
Symmetric choice reduction at 2 with 143 rule applications. Total rules 4630 place count 567 transition count 1810
Iterating global reduction 2 with 143 rules applied. Total rules applied 4773 place count 567 transition count 1810
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 2 with 143 rules applied. Total rules applied 4916 place count 567 transition count 1667
Drop transitions removed 266 transitions
Redundant transition composition rules discarded 266 transitions
Iterating global reduction 3 with 266 rules applied. Total rules applied 5182 place count 567 transition count 1401
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 3 with 15 rules applied. Total rules applied 5197 place count 567 transition count 1386
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 5212 place count 552 transition count 1386
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 5257 place count 507 transition count 1296
Iterating global reduction 5 with 45 rules applied. Total rules applied 5302 place count 507 transition count 1296
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 5 with 222 rules applied. Total rules applied 5524 place count 396 transition count 1185
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 5 with 151 rules applied. Total rules applied 5675 place count 396 transition count 1034
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 5765 place count 351 transition count 1034
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 6 with 90 rules applied. Total rules applied 5855 place count 351 transition count 944
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 7 with 49 rules applied. Total rules applied 5904 place count 351 transition count 895
Free-agglomeration rule applied 48 times.
Iterating global reduction 7 with 48 rules applied. Total rules applied 5952 place count 351 transition count 847
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 7 with 93 rules applied. Total rules applied 6045 place count 303 transition count 802
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 6047 place count 303 transition count 800
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 6061 place count 303 transition count 800
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 6062 place count 302 transition count 799
Iterating global reduction 8 with 1 rules applied. Total rules applied 6063 place count 302 transition count 799
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 6069 place count 302 transition count 793
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 6073 place count 302 transition count 793
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 6077 place count 298 transition count 789
Iterating global reduction 8 with 4 rules applied. Total rules applied 6081 place count 298 transition count 789
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 6082 place count 298 transition count 788
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 6088 place count 298 transition count 782
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 6089 place count 297 transition count 781
Applied a total of 6089 rules in 8210 ms. Remains 297 /8808 variables (removed 8511) and now considering 781/40665 (removed 39884) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 781 rows 297 cols
[2023-03-14 14:53:53] [INFO ] Computed 28 place invariants in 6 ms
[2023-03-14 14:53:54] [INFO ] [Real]Absence check using 28 positive place invariants in 4 ms returned sat
[2023-03-14 14:53:54] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 14:53:54] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2023-03-14 14:53:54] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-14 14:53:54] [INFO ] After 811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 269 ms.
[2023-03-14 14:53:55] [INFO ] After 1182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-14 14:53:55] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-14 14:53:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8808 places, 40665 transitions and 162100 arcs took 115 ms.
[2023-03-14 14:53:56] [INFO ] Flatten gal took : 1181 ms
Total runtime 256261 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANInsertWithFailure (PT), instance 090
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 8808 places, 40665 transitions, 162100 arcs.
Final Score: 1.11432231178E8
Took : 585 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1678806225157
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 211671:
syntax error
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="CANInsertWithFailure-PT-090"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is CANInsertWithFailure-PT-090, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813697300775"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-090.tgz
mv CANInsertWithFailure-PT-090 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;