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.r041-tajo-167813695100742.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 ltsminxred
Input is CANInsertWithFailure-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100742
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.8K Feb 26 00:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 00:59 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 16M 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-050-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678662593039

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:09:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 23:09:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:09:55] [INFO ] Load time of PNML (sax parser for PT used): 433 ms
[2023-03-12 23:09:55] [INFO ] Transformed 5604 places.
[2023-03-12 23:09:55] [INFO ] Transformed 15300 transitions.
[2023-03-12 23:09:55] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 558 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 645 ms. (steps per millisecond=15 ) properties (out of 16) seen :2
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-00 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 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 15300 rows 5604 cols
[2023-03-12 23:09:57] [INFO ] Computed 53 place invariants in 1273 ms
[2023-03-12 23:10:00] [INFO ] After 2449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 23:10:02] [INFO ] [Nat]Absence check using 51 positive place invariants in 111 ms returned sat
[2023-03-12 23:10:02] [INFO ] [Nat]Absence check using 51 positive and 2 generalized place invariants in 96 ms returned sat
[2023-03-12 23:10:25] [INFO ] After 21780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-12 23:10:25] [INFO ] State equation strengthened by 4950 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-12 23:10:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:10:25] [INFO ] After 25254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 317 ms.
Support contains 225 out of 5604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Graph (complete) has 20751 edges and 5604 vertex of which 5603 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.34 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 315 place count 5603 transition count 14986
Reduce places removed 314 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 326 rules applied. Total rules applied 641 place count 5289 transition count 14974
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 653 place count 5277 transition count 14974
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 653 place count 5277 transition count 14969
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 663 place count 5272 transition count 14969
Performed 2219 Post agglomeration using F-continuation condition.Transition count delta: 2219
Deduced a syphon composed of 2219 places in 19 ms
Reduce places removed 2219 places and 0 transitions.
Iterating global reduction 3 with 4438 rules applied. Total rules applied 5101 place count 3053 transition count 12750
Drop transitions removed 2133 transitions
Redundant transition composition rules discarded 2133 transitions
Iterating global reduction 3 with 2133 rules applied. Total rules applied 7234 place count 3053 transition count 10617
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 7242 place count 3053 transition count 10609
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 7250 place count 3045 transition count 10609
Partial Free-agglomeration rule applied 2665 times.
Drop transitions removed 2665 transitions
Iterating global reduction 4 with 2665 rules applied. Total rules applied 9915 place count 3045 transition count 10609
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 4 with 201 rules applied. Total rules applied 10116 place count 3045 transition count 10609
Applied a total of 10116 rules in 5536 ms. Remains 3045 /5604 variables (removed 2559) and now considering 10609/15300 (removed 4691) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5538 ms. Remains : 3045/5604 places, 10609/15300 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 14) seen :3
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) 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 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 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 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 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 27 ms. (steps per millisecond=370 ) 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 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 10609 rows 3045 cols
[2023-03-12 23:10:32] [INFO ] Computed 52 place invariants in 514 ms
[2023-03-12 23:10:33] [INFO ] After 922ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 23:10:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 62 ms returned sat
[2023-03-12 23:10:34] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 52 ms returned sat
[2023-03-12 23:10:42] [INFO ] After 6882ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-12 23:10:42] [INFO ] State equation strengthened by 9428 read => feed constraints.
[2023-03-12 23:10:58] [INFO ] After 16377ms SMT Verify possible using 9428 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-12 23:10:58] [INFO ] After 16733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 23:10:58] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 458 ms.
Support contains 172 out of 3045 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3045/3045 places, 10609/10609 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3045 transition count 10606
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 3042 transition count 10606
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 48 place count 3021 transition count 10585
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 2 with 33 rules applied. Total rules applied 81 place count 3021 transition count 10585
Applied a total of 81 rules in 996 ms. Remains 3021 /3045 variables (removed 24) and now considering 10585/10609 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 996 ms. Remains : 3021/3045 places, 10585/10609 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 597 ms. (steps per millisecond=16 ) properties (out of 10) seen :1
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 23 ms. (steps per millisecond=434 ) 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 23 ms. (steps per millisecond=434 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 10585 rows 3021 cols
[2023-03-12 23:11:01] [INFO ] Computed 52 place invariants in 384 ms
[2023-03-12 23:11:02] [INFO ] After 633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 23:11:02] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2023-03-12 23:11:02] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-12 23:11:09] [INFO ] After 6322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 23:11:09] [INFO ] State equation strengthened by 9596 read => feed constraints.
[2023-03-12 23:11:22] [INFO ] After 12792ms SMT Verify possible using 9596 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 23:11:30] [INFO ] Deduced a trap composed of 3 places in 3334 ms of which 8 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 23:11:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:11:30] [INFO ] After 28370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 142 ms.
Support contains 171 out of 3021 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3021/3021 places, 10585/10585 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3021 transition count 10585
Applied a total of 2 rules in 718 ms. Remains 3021 /3021 variables (removed 0) and now considering 10585/10585 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 718 ms. Remains : 3021/3021 places, 10585/10585 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 9) seen :1
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 42 ms. (steps per millisecond=238 ) properties (out of 8) 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 8) 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 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 21 ms. (steps per millisecond=476 ) properties (out of 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 10585 rows 3021 cols
[2023-03-12 23:11:32] [INFO ] Computed 52 place invariants in 408 ms
[2023-03-12 23:11:33] [INFO ] After 616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 23:11:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2023-03-12 23:11:34] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2023-03-12 23:11:40] [INFO ] After 5948ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 23:11:40] [INFO ] State equation strengthened by 9598 read => feed constraints.
[2023-03-12 23:11:54] [INFO ] After 14028ms SMT Verify possible using 9598 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 23:12:01] [INFO ] Deduced a trap composed of 3 places in 2973 ms of which 14 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 23:12:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:12:01] [INFO ] After 28008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 388 ms.
Support contains 152 out of 3021 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3021/3021 places, 10585/10585 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 3013 transition count 10577
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 3013 transition count 10576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 3012 transition count 10576
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 3012 transition count 10576
Applied a total of 26 rules in 1319 ms. Remains 3012 /3021 variables (removed 9) and now considering 10576/10585 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1319 ms. Remains : 3012/3021 places, 10576/10585 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) 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 7) 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 7) 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 7) seen :0
Interrupted probabilistic random walk after 66177 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66177 steps, saw 33827 distinct states, run finished after 3004 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 10576 rows 3012 cols
[2023-03-12 23:12:07] [INFO ] Computed 52 place invariants in 364 ms
[2023-03-12 23:12:08] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 23:12:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2023-03-12 23:12:08] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2023-03-12 23:12:14] [INFO ] After 5340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 23:12:14] [INFO ] State equation strengthened by 9619 read => feed constraints.
[2023-03-12 23:12:24] [INFO ] After 9934ms SMT Verify possible using 9619 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 23:12:29] [INFO ] After 15563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3222 ms.
[2023-03-12 23:12:33] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 709 ms.
Support contains 76 out of 3012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3012/3012 places, 10576/10576 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3012 transition count 10573
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 3009 transition count 10572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 3008 transition count 10572
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 84 place count 2970 transition count 10534
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 2970 transition count 10533
Partial Free-agglomeration rule applied 180 times.
Drop transitions removed 180 transitions
Iterating global reduction 3 with 180 rules applied. Total rules applied 265 place count 2970 transition count 10533
Applied a total of 265 rules in 1436 ms. Remains 2970 /3012 variables (removed 42) and now considering 10533/10576 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1436 ms. Remains : 2970/3012 places, 10533/10576 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 750 ms. (steps per millisecond=13 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 68384 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68384 steps, saw 29388 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10533 rows 2970 cols
[2023-03-12 23:12:39] [INFO ] Computed 52 place invariants in 341 ms
[2023-03-12 23:12:39] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 23:12:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 38 ms returned sat
[2023-03-12 23:12:40] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2023-03-12 23:12:44] [INFO ] After 4384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 23:12:45] [INFO ] State equation strengthened by 10019 read => feed constraints.
[2023-03-12 23:12:53] [INFO ] After 8388ms SMT Verify possible using 10019 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 23:12:56] [INFO ] After 11846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2550 ms.
[2023-03-12 23:12:59] [INFO ] After 19585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 236 ms.
Support contains 76 out of 2970 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2970/2970 places, 10533/10533 transitions.
Applied a total of 0 rules in 389 ms. Remains 2970 /2970 variables (removed 0) and now considering 10533/10533 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 2970/2970 places, 10533/10533 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2970/2970 places, 10533/10533 transitions.
Applied a total of 0 rules in 373 ms. Remains 2970 /2970 variables (removed 0) and now considering 10533/10533 (removed 0) transitions.
[2023-03-12 23:13:00] [INFO ] Invariant cache hit.
[2023-03-12 23:13:04] [INFO ] Implicit Places using invariants in 3661 ms returned []
Implicit Place search using SMT only with invariants took 3664 ms to find 0 implicit places.
[2023-03-12 23:13:04] [INFO ] Invariant cache hit.
[2023-03-12 23:13:09] [INFO ] Dead Transitions using invariants and state equation in 4965 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9005 ms. Remains : 2970/2970 places, 10533/10533 transitions.
Graph (trivial) has 9718 edges and 2970 vertex of which 2589 / 2970 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2587 places
Drop transitions removed 7190 transitions
Ensure Unique test removed 2473 transitions
Reduce isomorphic transitions removed 9663 transitions.
Graph (complete) has 1178 edges and 383 vertex of which 240 are kept as prefixes of interest. Removing 143 places using SCC suffix rule.1 ms
Discarding 143 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Drop transitions removed 184 transitions
Reduce isomorphic transitions removed 184 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 186 rules applied. Total rules applied 188 place count 240 transition count 639
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 192 place count 238 transition count 637
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 192 place count 238 transition count 636
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 237 transition count 636
Discarding 130 places :
Symmetric choice reduction at 2 with 130 rule applications. Total rules 324 place count 107 transition count 373
Iterating global reduction 2 with 130 rules applied. Total rules applied 454 place count 107 transition count 373
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 2 with 87 rules applied. Total rules applied 541 place count 107 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 543 place count 106 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 545 place count 105 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 546 place count 105 transition count 283
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 555 place count 105 transition count 274
Free-agglomeration rule applied 7 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 562 place count 105 transition count 266
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 573 place count 98 transition count 262
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 575 place count 98 transition count 260
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 576 place count 98 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 577 place count 97 transition count 259
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 578 place count 96 transition count 256
Iterating global reduction 6 with 1 rules applied. Total rules applied 579 place count 96 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 580 place count 96 transition count 255
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 583 place count 96 transition count 255
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 585 place count 94 transition count 253
Applied a total of 585 rules in 96 ms. Remains 94 /2970 variables (removed 2876) and now considering 253/10533 (removed 10280) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 253 rows 94 cols
[2023-03-12 23:13:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 23:13:09] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 23:13:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 23:13:09] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 23:13:09] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-12 23:13:09] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-12 23:13:09] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 23:13:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2970 places, 10533 transitions and 41942 arcs took 44 ms.
[2023-03-12 23:13:10] [INFO ] Flatten gal took : 486 ms
Total runtime 195657 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/542/inv_0_ --invariant=/tmp/542/inv_1_ --invariant=/tmp/542/inv_2_ --invariant=/tmp/542/inv_3_ --invariant=/tmp/542/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12230108 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16075060 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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-050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CANInsertWithFailure-PT-050, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100742"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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