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-167813697300767.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-080, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697300767
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 00:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 00:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:10 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 39M 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-080-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678804691223

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-080
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 14:38:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 14:38:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:38:14] [INFO ] Load time of PNML (sax parser for PT used): 1061 ms
[2023-03-14 14:38:14] [INFO ] Transformed 13764 places.
[2023-03-14 14:38:14] [INFO ] Transformed 38880 transitions.
[2023-03-14 14:38:14] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1326 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 922 ms. (steps per millisecond=10 ) properties (out of 16) seen :3
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 38880 rows 13764 cols
[2023-03-14 14:38:26] [INFO ] Computed 83 place invariants in 9334 ms
[2023-03-14 14:38:31] [INFO ] [Real]Absence check using 81 positive place invariants in 172 ms returned sat
[2023-03-14 14:38:31] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 335 ms returned sat
[2023-03-14 14:38:33] [INFO ] After 7028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-14 14:38:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 215 ms returned sat
[2023-03-14 14:38:38] [INFO ] [Nat]Absence check using 81 positive and 2 generalized place invariants in 370 ms returned sat
[2023-03-14 14:38:58] [INFO ] After 16627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-14 14:38:58] [INFO ] State equation strengthened by 12720 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:38:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:38:58] [INFO ] After 25265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 329 out of 13764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Graph (complete) has 52401 edges and 13764 vertex of which 13763 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.61 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 430 transitions
Trivial Post-agglo rules discarded 430 transitions
Performed 430 trivial Post agglomeration. Transition count delta: 430
Iterating post reduction 0 with 430 rules applied. Total rules applied 431 place count 13763 transition count 38450
Reduce places removed 430 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 433 rules applied. Total rules applied 864 place count 13333 transition count 38447
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 867 place count 13330 transition count 38447
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 867 place count 13330 transition count 38411
Deduced a syphon composed of 36 places in 26 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 939 place count 13294 transition count 38411
Performed 6148 Post agglomeration using F-continuation condition.Transition count delta: 6148
Deduced a syphon composed of 6148 places in 34 ms
Reduce places removed 6148 places and 0 transitions.
Iterating global reduction 3 with 12296 rules applied. Total rules applied 13235 place count 7146 transition count 32263
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 3 with 79 rules applied. Total rules applied 13314 place count 7146 transition count 32184
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 13393 place count 7067 transition count 32184
Partial Free-agglomeration rule applied 6348 times.
Drop transitions removed 6348 transitions
Iterating global reduction 4 with 6348 rules applied. Total rules applied 19741 place count 7067 transition count 32184
Partial Free-agglomeration rule applied 2920 times.
Drop transitions removed 2920 transitions
Iterating global reduction 4 with 2920 rules applied. Total rules applied 22661 place count 7067 transition count 32184
Applied a total of 22661 rules in 18149 ms. Remains 7067 /13764 variables (removed 6697) and now considering 32184/38880 (removed 6696) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18159 ms. Remains : 7067/13764 places, 32184/38880 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 685 ms. (steps per millisecond=14 ) properties (out of 13) seen :2
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-03-14 14:39:17] [INFO ] Flow matrix only has 32101 transitions (discarded 83 similar events)
// Phase 1: matrix 32101 rows 7067 cols
[2023-03-14 14:39:20] [INFO ] Computed 82 place invariants in 2944 ms
[2023-03-14 14:39:23] [INFO ] [Real]Absence check using 80 positive place invariants in 114 ms returned sat
[2023-03-14 14:39:23] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 137 ms returned sat
[2023-03-14 14:39:24] [INFO ] After 3174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-14 14:39:26] [INFO ] [Nat]Absence check using 80 positive place invariants in 115 ms returned sat
[2023-03-14 14:39:26] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 145 ms returned sat
[2023-03-14 14:39:49] [INFO ] After 21402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-14 14:39:49] [INFO ] State equation strengthened by 31005 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:39:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:39:49] [INFO ] After 25455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 327 out of 7067 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7067/7067 places, 32184/32184 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 7067 transition count 32184
Applied a total of 1 rules in 3914 ms. Remains 7067 /7067 variables (removed 0) and now considering 32184/32184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3915 ms. Remains : 7067/7067 places, 32184/32184 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 820 ms. (steps per millisecond=12 ) properties (out of 11) seen :1
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) 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 10) seen :0
Interrupted probabilistic random walk after 59774 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59774 steps, saw 54938 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-14 14:39:57] [INFO ] Flow matrix only has 32101 transitions (discarded 83 similar events)
// Phase 1: matrix 32101 rows 7067 cols
[2023-03-14 14:40:00] [INFO ] Computed 82 place invariants in 2407 ms
[2023-03-14 14:40:02] [INFO ] [Real]Absence check using 80 positive place invariants in 110 ms returned sat
[2023-03-14 14:40:02] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 142 ms returned sat
[2023-03-14 14:40:03] [INFO ] After 3090ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-14 14:40:05] [INFO ] [Nat]Absence check using 80 positive place invariants in 117 ms returned sat
[2023-03-14 14:40:05] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 163 ms returned sat
[2023-03-14 14:40:28] [INFO ] After 21118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 14:40:28] [INFO ] State equation strengthened by 31006 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:40:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:40:28] [INFO ] After 25288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 294 out of 7067 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7067/7067 places, 32184/32184 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 7067 transition count 32183
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7066 transition count 32183
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 32 place count 7051 transition count 32168
Partial Free-agglomeration rule applied 94 times.
Drop transitions removed 94 transitions
Iterating global reduction 0 with 94 rules applied. Total rules applied 126 place count 7051 transition count 32168
Applied a total of 126 rules in 5519 ms. Remains 7051 /7067 variables (removed 16) and now considering 32168/32184 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5519 ms. Remains : 7051/7067 places, 32168/32184 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 633 ms. (steps per millisecond=15 ) properties (out of 10) seen :1
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-05 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 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 45 ms. (steps per millisecond=222 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 43 ms. (steps per millisecond=232 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-14 14:40:35] [INFO ] Flow matrix only has 32097 transitions (discarded 71 similar events)
// Phase 1: matrix 32097 rows 7051 cols
[2023-03-14 14:40:37] [INFO ] Computed 82 place invariants in 2028 ms
[2023-03-14 14:40:39] [INFO ] [Real]Absence check using 80 positive place invariants in 114 ms returned sat
[2023-03-14 14:40:39] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 138 ms returned sat
[2023-03-14 14:40:39] [INFO ] After 2703ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 14:40:41] [INFO ] [Nat]Absence check using 80 positive place invariants in 116 ms returned sat
[2023-03-14 14:40:41] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 141 ms returned sat
[2023-03-14 14:41:04] [INFO ] After 21806ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-14 14:41:05] [INFO ] State equation strengthened by 31139 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:41:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:41:05] [INFO ] After 25390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 293 out of 7051 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7051/7051 places, 32168/32168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7050 transition count 32167
Applied a total of 2 rules in 3997 ms. Remains 7050 /7051 variables (removed 1) and now considering 32167/32168 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3997 ms. Remains : 7050/7051 places, 32167/32168 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 693 ms. (steps per millisecond=14 ) properties (out of 9) seen :0
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 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 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 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
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 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 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 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 59048 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59048 steps, saw 54683 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-14 14:41:13] [INFO ] Flow matrix only has 32096 transitions (discarded 71 similar events)
// Phase 1: matrix 32096 rows 7050 cols
[2023-03-14 14:41:15] [INFO ] Computed 82 place invariants in 2248 ms
[2023-03-14 14:41:17] [INFO ] [Real]Absence check using 80 positive place invariants in 116 ms returned sat
[2023-03-14 14:41:17] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 142 ms returned sat
[2023-03-14 14:41:18] [INFO ] After 2782ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 14:41:20] [INFO ] [Nat]Absence check using 80 positive place invariants in 102 ms returned sat
[2023-03-14 14:41:20] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 142 ms returned sat
[2023-03-14 14:41:43] [INFO ] After 21906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 14:41:43] [INFO ] State equation strengthened by 31141 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:41:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:41:43] [INFO ] After 25549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 293 out of 7050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7050/7050 places, 32167/32167 transitions.
Applied a total of 0 rules in 2026 ms. Remains 7050 /7050 variables (removed 0) and now considering 32167/32167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2027 ms. Remains : 7050/7050 places, 32167/32167 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7050/7050 places, 32167/32167 transitions.
Applied a total of 0 rules in 1862 ms. Remains 7050 /7050 variables (removed 0) and now considering 32167/32167 (removed 0) transitions.
[2023-03-14 14:41:47] [INFO ] Flow matrix only has 32096 transitions (discarded 71 similar events)
[2023-03-14 14:41:47] [INFO ] Invariant cache hit.
[2023-03-14 14:41:53] [INFO ] Implicit Places using invariants in 5350 ms returned []
Implicit Place search using SMT only with invariants took 5351 ms to find 0 implicit places.
[2023-03-14 14:41:53] [INFO ] Flow matrix only has 32096 transitions (discarded 71 similar events)
[2023-03-14 14:41:53] [INFO ] Invariant cache hit.
[2023-03-14 14:42:10] [INFO ] Dead Transitions using invariants and state equation in 17537 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24758 ms. Remains : 7050/7050 places, 32167/32167 transitions.
Graph (trivial) has 24902 edges and 7050 vertex of which 3440 / 7050 are part of one of the 2 SCC in 11 ms
Free SCC test removed 3438 places
Drop transitions removed 11436 transitions
Ensure Unique test removed 4898 transitions
Reduce isomorphic transitions removed 16334 transitions.
Graph (complete) has 16318 edges and 3612 vertex of which 3584 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Discarding 28 places :
Also discarding 0 output transitions
Discarding 1469 places :
Symmetric choice reduction at 0 with 1469 rule applications. Total rules 1471 place count 2115 transition count 9957
Iterating global reduction 0 with 1469 rules applied. Total rules applied 2940 place count 2115 transition count 9957
Ensure Unique test removed 1469 transitions
Reduce isomorphic transitions removed 1469 transitions.
Iterating post reduction 0 with 1469 rules applied. Total rules applied 4409 place count 2115 transition count 8488
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4411 place count 2114 transition count 8487
Drop transitions removed 1494 transitions
Redundant transition composition rules discarded 1494 transitions
Iterating global reduction 1 with 1494 rules applied. Total rules applied 5905 place count 2114 transition count 6993
Performed 1356 Post agglomeration using F-continuation condition.Transition count delta: 1356
Deduced a syphon composed of 1356 places in 3 ms
Reduce places removed 1356 places and 0 transitions.
Iterating global reduction 1 with 2712 rules applied. Total rules applied 8617 place count 758 transition count 5637
Ensure Unique test removed 2638 transitions
Reduce isomorphic transitions removed 2638 transitions.
Iterating post reduction 1 with 2638 rules applied. Total rules applied 11255 place count 758 transition count 2999
Drop transitions removed 274 transitions
Redundant transition composition rules discarded 274 transitions
Iterating global reduction 2 with 274 rules applied. Total rules applied 11529 place count 758 transition count 2725
Free-agglomeration rule applied 44 times.
Iterating global reduction 2 with 44 rules applied. Total rules applied 11573 place count 758 transition count 2681
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 11618 place count 714 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11619 place count 713 transition count 2679
Iterating global reduction 3 with 1 rules applied. Total rules applied 11620 place count 713 transition count 2679
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11622 place count 713 transition count 2677
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11624 place count 711 transition count 2677
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 4 with 199 rules applied. Total rules applied 11823 place count 711 transition count 2677
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 4 with 35 rules applied. Total rules applied 11858 place count 711 transition count 2642
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 11871 place count 711 transition count 2629
Applied a total of 11871 rules in 22098 ms. Remains 711 /7050 variables (removed 6339) and now considering 2629/32167 (removed 29538) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 2629 rows 711 cols
[2023-03-14 14:42:32] [INFO ] Computed 54 place invariants in 49 ms
[2023-03-14 14:42:33] [INFO ] [Real]Absence check using 54 positive place invariants in 14 ms returned sat
[2023-03-14 14:42:33] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 14:42:33] [INFO ] [Nat]Absence check using 54 positive place invariants in 14 ms returned sat
[2023-03-14 14:42:35] [INFO ] After 1775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 14:42:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 14:42:36] [INFO ] After 1439ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-14 14:42:38] [INFO ] After 3456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1458 ms.
[2023-03-14 14:42:40] [INFO ] After 7006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-14 14:42:40] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-14 14:42:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7050 places, 32167 transitions and 127553 arcs took 146 ms.
[2023-03-14 14:42:42] [INFO ] Flatten gal took : 1329 ms
Total runtime 268701 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANInsertWithFailure (PT), instance 080
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: 7050 places, 32167 transitions, 127553 arcs.
Final Score: 6.0248344545E7
Took : 517 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678805481706

--------------------
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 166858:
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-080"
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-080, 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-167813697300767"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-080.tgz
mv CANInsertWithFailure-PT-080 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;