fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813695100775
Last Updated
May 14, 2023

About the Execution of LTSMin+red for CANInsertWithFailure-PT-090

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8335.287 3247190.00 9539546.00 873.10 TFF?T?TTTF?TT?T? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695100775.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-090, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100775
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 00:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 49M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678666647404

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-090
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 00:17:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 00:17:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:17:29] [INFO ] Load time of PNML (sax parser for PT used): 897 ms
[2023-03-13 00:17:29] [INFO ] Transformed 17284 places.
[2023-03-13 00:17:30] [INFO ] Transformed 49140 transitions.
[2023-03-13 00:17:30] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 1134 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 805 ms. (steps per millisecond=12 ) properties (out of 16) seen :4
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 49140 rows 17284 cols
[2023-03-13 00:17:45] [INFO ] Computed 93 place invariants in 13852 ms
[2023-03-13 00:17:51] [INFO ] [Real]Absence check using 91 positive place invariants in 256 ms returned sat
[2023-03-13 00:17:51] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 498 ms returned sat
[2023-03-13 00:17:54] [INFO ] After 8704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 00:17:59] [INFO ] [Nat]Absence check using 91 positive place invariants in 229 ms returned sat
[2023-03-13 00:18:00] [INFO ] [Nat]Absence check using 91 positive and 2 generalized place invariants in 453 ms returned sat
[2023-03-13 00:18:19] [INFO ] After 15800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-13 00:18:19] [INFO ] State equation strengthened by 16110 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-13 00:18:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:18:19] [INFO ] After 25378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 170 out of 17284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Graph (complete) has 66151 edges and 17284 vertex of which 17283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.73 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 575 transitions
Trivial Post-agglo rules discarded 575 transitions
Performed 575 trivial Post agglomeration. Transition count delta: 575
Iterating post reduction 0 with 575 rules applied. Total rules applied 576 place count 17283 transition count 48565
Reduce places removed 575 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 578 rules applied. Total rules applied 1154 place count 16708 transition count 48562
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1157 place count 16705 transition count 48562
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 1157 place count 16705 transition count 48544
Deduced a syphon composed of 18 places in 27 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 1193 place count 16687 transition count 48544
Performed 7835 Post agglomeration using F-continuation condition.Transition count delta: 7835
Deduced a syphon composed of 7835 places in 53 ms
Reduce places removed 7835 places and 0 transitions.
Iterating global reduction 3 with 15670 rules applied. Total rules applied 16863 place count 8852 transition count 40709
Free-agglomeration rule (complex) applied 31 times.
Iterating global reduction 3 with 31 rules applied. Total rules applied 16894 place count 8852 transition count 40678
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 16925 place count 8821 transition count 40678
Partial Free-agglomeration rule applied 8245 times.
Drop transitions removed 8245 transitions
Iterating global reduction 4 with 8245 rules applied. Total rules applied 25170 place count 8821 transition count 40678
Partial Free-agglomeration rule applied 1587 times.
Drop transitions removed 1587 transitions
Iterating global reduction 4 with 1587 rules applied. Total rules applied 26757 place count 8821 transition count 40678
Applied a total of 26757 rules in 27827 ms. Remains 8821 /17284 variables (removed 8463) and now considering 40678/49140 (removed 8462) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27839 ms. Remains : 8821/17284 places, 40678/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 741 ms. (steps per millisecond=13 ) properties (out of 12) seen :4
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 89 ms. (steps per millisecond=112 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 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 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 00:18:48] [INFO ] Flow matrix only has 40633 transitions (discarded 45 similar events)
// Phase 1: matrix 40633 rows 8821 cols
[2023-03-13 00:18:52] [INFO ] Computed 92 place invariants in 3870 ms
[2023-03-13 00:18:54] [INFO ] [Real]Absence check using 90 positive place invariants in 142 ms returned sat
[2023-03-13 00:18:55] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 171 ms returned sat
[2023-03-13 00:18:55] [INFO ] After 3158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 00:18:57] [INFO ] [Nat]Absence check using 90 positive place invariants in 131 ms returned sat
[2023-03-13 00:18:57] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 180 ms returned sat
[2023-03-13 00:19:20] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 163 out of 8821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8821/8821 places, 40678/40678 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 8817 transition count 40674
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 8817 transition count 40674
Applied a total of 10 rules in 9051 ms. Remains 8817 /8821 variables (removed 4) and now considering 40674/40678 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9051 ms. Remains : 8817/8821 places, 40674/40678 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 680 ms. (steps per millisecond=14 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 64735 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{3=1}
Probabilistic random walk after 64735 steps, saw 61722 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
[2023-03-13 00:19:33] [INFO ] Flow matrix only has 40631 transitions (discarded 43 similar events)
// Phase 1: matrix 40631 rows 8817 cols
[2023-03-13 00:19:37] [INFO ] Computed 92 place invariants in 3647 ms
[2023-03-13 00:19:39] [INFO ] [Real]Absence check using 90 positive place invariants in 137 ms returned sat
[2023-03-13 00:19:39] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 172 ms returned sat
[2023-03-13 00:19:40] [INFO ] After 2910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 00:19:42] [INFO ] [Nat]Absence check using 90 positive place invariants in 125 ms returned sat
[2023-03-13 00:19:42] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 171 ms returned sat
[2023-03-13 00:20:05] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 161 out of 8817 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8817/8817 places, 40674/40674 transitions.
Partial Free-agglomeration rule applied 179 times.
Drop transitions removed 179 transitions
Iterating global reduction 0 with 179 rules applied. Total rules applied 179 place count 8817 transition count 40674
Applied a total of 179 rules in 6376 ms. Remains 8817 /8817 variables (removed 0) and now considering 40674/40674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6376 ms. Remains : 8817/8817 places, 40674/40674 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 762 ms. (steps per millisecond=13 ) properties (out of 7) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 00:20:12] [INFO ] Flow matrix only has 40631 transitions (discarded 43 similar events)
// Phase 1: matrix 40631 rows 8817 cols
[2023-03-13 00:20:16] [INFO ] Computed 92 place invariants in 3333 ms
[2023-03-13 00:20:17] [INFO ] [Real]Absence check using 90 positive place invariants in 130 ms returned sat
[2023-03-13 00:20:18] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 174 ms returned sat
[2023-03-13 00:20:41] [INFO ] After 22695ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:20:41] [INFO ] State equation strengthened by 39831 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:20:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:20:41] [INFO ] After 25597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 146 out of 8817 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8817/8817 places, 40674/40674 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 8 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 8806 transition count 40663
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 8806 transition count 40663
Applied a total of 25 rules in 9831 ms. Remains 8806 /8817 variables (removed 11) and now considering 40663/40674 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9831 ms. Remains : 8806/8817 places, 40663/40674 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 6) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 00:20:52] [INFO ] Flow matrix only has 40623 transitions (discarded 40 similar events)
// Phase 1: matrix 40623 rows 8806 cols
[2023-03-13 00:20:55] [INFO ] Computed 92 place invariants in 3320 ms
[2023-03-13 00:20:57] [INFO ] [Real]Absence check using 90 positive place invariants in 129 ms returned sat
[2023-03-13 00:20:57] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 171 ms returned sat
[2023-03-13 00:20:57] [INFO ] After 2149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:20:59] [INFO ] [Nat]Absence check using 90 positive place invariants in 118 ms returned sat
[2023-03-13 00:20:59] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 167 ms returned sat
[2023-03-13 00:21:22] [INFO ] After 22390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 00:21:22] [INFO ] State equation strengthened by 39857 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-13 00:21:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:21:22] [INFO ] After 25399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 145 out of 8806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8806/8806 places, 40663/40663 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8805 transition count 40662
Applied a total of 2 rules in 6178 ms. Remains 8805 /8806 variables (removed 1) and now considering 40662/40663 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6179 ms. Remains : 8805/8806 places, 40662/40663 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 68978 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68978 steps, saw 63885 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 00:21:32] [INFO ] Flow matrix only has 40622 transitions (discarded 40 similar events)
// Phase 1: matrix 40622 rows 8805 cols
[2023-03-13 00:21:36] [INFO ] Computed 92 place invariants in 3950 ms
[2023-03-13 00:21:38] [INFO ] [Real]Absence check using 90 positive place invariants in 128 ms returned sat
[2023-03-13 00:21:38] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 171 ms returned sat
[2023-03-13 00:21:39] [INFO ] After 2255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:21:40] [INFO ] [Nat]Absence check using 90 positive place invariants in 90 ms returned sat
[2023-03-13 00:21:40] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 166 ms returned sat
[2023-03-13 00:22:04] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 145 out of 8805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8805/8805 places, 40662/40662 transitions.
Applied a total of 0 rules in 3161 ms. Remains 8805 /8805 variables (removed 0) and now considering 40662/40662 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3162 ms. Remains : 8805/8805 places, 40662/40662 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8805/8805 places, 40662/40662 transitions.
Applied a total of 0 rules in 3135 ms. Remains 8805 /8805 variables (removed 0) and now considering 40662/40662 (removed 0) transitions.
[2023-03-13 00:22:10] [INFO ] Flow matrix only has 40622 transitions (discarded 40 similar events)
[2023-03-13 00:22:10] [INFO ] Invariant cache hit.
[2023-03-13 00:22:11] [INFO ] Implicit Places using invariants in 827 ms returned []
Implicit Place search using SMT only with invariants took 828 ms to find 0 implicit places.
[2023-03-13 00:22:11] [INFO ] Flow matrix only has 40622 transitions (discarded 40 similar events)
[2023-03-13 00:22:11] [INFO ] Invariant cache hit.
[2023-03-13 00:22:34] [INFO ] Dead Transitions using invariants and state equation in 23572 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27541 ms. Remains : 8805/8805 places, 40662/40662 transitions.
Graph (trivial) has 36678 edges and 8805 vertex of which 6704 / 8805 are part of one of the 1 SCC in 10 ms
Free SCC test removed 6703 places
Drop transitions removed 24981 transitions
Ensure Unique test removed 7760 transitions
Reduce isomorphic transitions removed 32741 transitions.
Graph (complete) has 8568 edges and 2102 vertex of which 1917 are kept as prefixes of interest. Removing 185 places using SCC suffix rule.3 ms
Discarding 185 places :
Also discarding 61 output transitions
Drop transitions removed 61 transitions
Drop transitions removed 1066 transitions
Reduce isomorphic transitions removed 1066 transitions.
Iterating post reduction 0 with 1066 rules applied. Total rules applied 1068 place count 1917 transition count 6794
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 1068 place count 1917 transition count 6784
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1088 place count 1907 transition count 6784
Discarding 1202 places :
Symmetric choice reduction at 1 with 1202 rule applications. Total rules 2290 place count 705 transition count 3080
Iterating global reduction 1 with 1202 rules applied. Total rules applied 3492 place count 705 transition count 3080
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Iterating post reduction 1 with 999 rules applied. Total rules applied 4491 place count 705 transition count 2081
Discarding 143 places :
Symmetric choice reduction at 2 with 143 rule applications. Total rules 4634 place count 562 transition count 1795
Iterating global reduction 2 with 143 rules applied. Total rules applied 4777 place count 562 transition count 1795
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 2 with 143 rules applied. Total rules applied 4920 place count 562 transition count 1652
Drop transitions removed 265 transitions
Redundant transition composition rules discarded 265 transitions
Iterating global reduction 3 with 265 rules applied. Total rules applied 5185 place count 562 transition count 1387
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 3 with 15 rules applied. Total rules applied 5200 place count 562 transition count 1372
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 5215 place count 547 transition count 1372
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 5260 place count 502 transition count 1282
Iterating global reduction 5 with 45 rules applied. Total rules applied 5305 place count 502 transition count 1282
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 5 with 222 rules applied. Total rules applied 5527 place count 391 transition count 1171
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 5 with 151 rules applied. Total rules applied 5678 place count 391 transition count 1020
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 5768 place count 346 transition count 1020
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 6 with 90 rules applied. Total rules applied 5858 place count 346 transition count 930
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 7 with 49 rules applied. Total rules applied 5907 place count 346 transition count 881
Free-agglomeration rule applied 48 times.
Iterating global reduction 7 with 48 rules applied. Total rules applied 5955 place count 346 transition count 833
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 7 with 93 rules applied. Total rules applied 6048 place count 298 transition count 788
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 6050 place count 298 transition count 786
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 6064 place count 298 transition count 786
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 6065 place count 297 transition count 785
Iterating global reduction 8 with 1 rules applied. Total rules applied 6066 place count 297 transition count 785
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 6072 place count 297 transition count 779
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 6076 place count 297 transition count 779
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 6080 place count 293 transition count 775
Iterating global reduction 8 with 4 rules applied. Total rules applied 6084 place count 293 transition count 775
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 6085 place count 293 transition count 774
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 6091 place count 293 transition count 768
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 6092 place count 292 transition count 767
Applied a total of 6092 rules in 7886 ms. Remains 292 /8805 variables (removed 8513) and now considering 767/40662 (removed 39895) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 767 rows 292 cols
[2023-03-13 00:22:42] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-13 00:22:42] [INFO ] [Real]Absence check using 28 positive place invariants in 3 ms returned sat
[2023-03-13 00:22:42] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:22:42] [INFO ] [Nat]Absence check using 28 positive place invariants in 3 ms returned sat
[2023-03-13 00:22:43] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 00:22:43] [INFO ] After 536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-13 00:22:43] [INFO ] After 767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-13 00:22:43] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-13 00:22:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8805 places, 40662 transitions and 162108 arcs took 172 ms.
[2023-03-13 00:22:45] [INFO ] Flatten gal took : 1207 ms
Total runtime 316625 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 --inv-bin-par --invariant=/tmp/541/inv_0_ --invariant=/tmp/541/inv_1_ --invariant=/tmp/541/inv_2_ --invariant=/tmp/541/inv_3_ --invariant=/tmp/541/inv_4_ --inv-par
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityFireability-03
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityFireability-05
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityFireability-10
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityFireability-13
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityFireability-15

BK_STOP 1678669894594

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name CANInsertWithFailure-PT-090-ReachabilityFireability-03
rfs formula type EF
rfs formula formula --invariant=/tmp/541/inv_0_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityFireability-05
rfs formula type AG
rfs formula formula --invariant=/tmp/541/inv_1_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityFireability-10
rfs formula type EF
rfs formula formula --invariant=/tmp/541/inv_2_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/541/inv_3_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityFireability-15
rfs formula type AG
rfs formula formula --invariant=/tmp/541/inv_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 8805 places, 40662 transitions and 162108 arcs
pnml2lts-sym: Petri net gen analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.520 real 0.370 user 0.150 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 40662->40622 groups
pnml2lts-sym: Regrouping took 849.640 real 848.720 user 0.880 sys
pnml2lts-sym: state vector length is 8805; there are 40622 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
MDD Unique table full, 268435456 of 268435456 buckets filled!

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-090"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="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-090, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100775"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;