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-167813695100743.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100743
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678662646437

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-050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:10:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 23:10:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:10:48] [INFO ] Load time of PNML (sax parser for PT used): 436 ms
[2023-03-12 23:10:48] [INFO ] Transformed 5604 places.
[2023-03-12 23:10:48] [INFO ] Transformed 15300 transitions.
[2023-03-12 23:10:49] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 575 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 8 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 16) seen :7
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) 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
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 15300 rows 5604 cols
[2023-03-12 23:10:51] [INFO ] Computed 53 place invariants in 1208 ms
[2023-03-12 23:10:53] [INFO ] [Real]Absence check using 51 positive place invariants in 133 ms returned sat
[2023-03-12 23:10:53] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 99 ms returned sat
[2023-03-12 23:10:54] [INFO ] After 3377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 23:10:56] [INFO ] [Nat]Absence check using 51 positive place invariants in 76 ms returned sat
[2023-03-12 23:10:56] [INFO ] [Nat]Absence check using 51 positive and 2 generalized place invariants in 85 ms returned sat
[2023-03-12 23:11:19] [INFO ] After 22151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 23:11:19] [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:11:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:11:20] [INFO ] After 25110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 998 ms.
Support contains 103 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.20 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 284 rules applied. Total rules applied 285 place count 5603 transition count 15016
Reduce places removed 284 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 285 rules applied. Total rules applied 570 place count 5319 transition count 15015
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 571 place count 5318 transition count 15015
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 571 place count 5318 transition count 15001
Deduced a syphon composed of 14 places in 7 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 599 place count 5304 transition count 15001
Performed 2402 Post agglomeration using F-continuation condition.Transition count delta: 2402
Deduced a syphon composed of 2402 places in 12 ms
Reduce places removed 2402 places and 0 transitions.
Iterating global reduction 3 with 4804 rules applied. Total rules applied 5403 place count 2902 transition count 12599
Drop transitions removed 2319 transitions
Redundant transition composition rules discarded 2319 transitions
Iterating global reduction 3 with 2319 rules applied. Total rules applied 7722 place count 2902 transition count 10280
Free-agglomeration rule (complex) applied 50 times.
Iterating global reduction 3 with 50 rules applied. Total rules applied 7772 place count 2902 transition count 10230
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 7822 place count 2852 transition count 10230
Partial Free-agglomeration rule applied 2437 times.
Drop transitions removed 2437 transitions
Iterating global reduction 4 with 2437 rules applied. Total rules applied 10259 place count 2852 transition count 10230
Partial Free-agglomeration rule applied 657 times.
Drop transitions removed 657 transitions
Iterating global reduction 4 with 657 rules applied. Total rules applied 10916 place count 2852 transition count 10230
Applied a total of 10916 rules in 5662 ms. Remains 2852 /5604 variables (removed 2752) and now considering 10230/15300 (removed 5070) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5664 ms. Remains : 2852/5604 places, 10230/15300 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 5) seen :1
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-13 FALSE 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 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10230 rows 2852 cols
[2023-03-12 23:11:27] [INFO ] Computed 52 place invariants in 396 ms
[2023-03-12 23:11:28] [INFO ] [Real]Absence check using 50 positive place invariants in 31 ms returned sat
[2023-03-12 23:11:28] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2023-03-12 23:11:28] [INFO ] After 734ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:11:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2023-03-12 23:11:29] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 43 ms returned sat
[2023-03-12 23:11:34] [INFO ] After 5768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:11:35] [INFO ] State equation strengthened by 9788 read => feed constraints.
[2023-03-12 23:11:43] [INFO ] After 8359ms SMT Verify possible using 9788 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:11:47] [INFO ] After 12310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2899 ms.
[2023-03-12 23:11:50] [INFO ] After 21866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 95 ms.
Support contains 98 out of 2852 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2852/2852 places, 10230/10230 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2850 transition count 10228
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 2850 transition count 10228
Applied a total of 6 rules in 1122 ms. Remains 2850 /2852 variables (removed 2) and now considering 10228/10230 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1122 ms. Remains : 2850/2852 places, 10228/10230 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 4) seen :1
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-05 FALSE 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 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10228 rows 2850 cols
[2023-03-12 23:11:52] [INFO ] Computed 52 place invariants in 512 ms
[2023-03-12 23:11:53] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2023-03-12 23:11:53] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 42 ms returned sat
[2023-03-12 23:11:53] [INFO ] After 949ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:11:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 37 ms returned sat
[2023-03-12 23:11:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 42 ms returned sat
[2023-03-12 23:11:58] [INFO ] After 4852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 23:11:59] [INFO ] State equation strengthened by 9794 read => feed constraints.
[2023-03-12 23:12:05] [INFO ] After 6643ms SMT Verify possible using 9794 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:12:08] [INFO ] After 9567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1857 ms.
[2023-03-12 23:12:10] [INFO ] After 17011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 44 ms.
Support contains 96 out of 2850 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2850/2850 places, 10228/10228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2849 transition count 10227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 2849 transition count 10227
Applied a total of 3 rules in 1305 ms. Remains 2849 /2850 variables (removed 1) and now considering 10227/10228 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1305 ms. Remains : 2849/2850 places, 10227/10228 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 61556 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61556 steps, saw 34263 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10227 rows 2849 cols
[2023-03-12 23:12:15] [INFO ] Computed 52 place invariants in 356 ms
[2023-03-12 23:12:16] [INFO ] [Real]Absence check using 50 positive place invariants in 75 ms returned sat
[2023-03-12 23:12:16] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-12 23:12:16] [INFO ] After 629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:12:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 51 ms returned sat
[2023-03-12 23:12:16] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 51 ms returned sat
[2023-03-12 23:12:21] [INFO ] After 5099ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 23:12:22] [INFO ] State equation strengthened by 9797 read => feed constraints.
[2023-03-12 23:12:31] [INFO ] After 9646ms SMT Verify possible using 9797 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:12:35] [INFO ] After 13994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3024 ms.
[2023-03-12 23:12:39] [INFO ] After 22827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 96 out of 2849 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2849/2849 places, 10227/10227 transitions.
Applied a total of 0 rules in 505 ms. Remains 2849 /2849 variables (removed 0) and now considering 10227/10227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 2849/2849 places, 10227/10227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2849/2849 places, 10227/10227 transitions.
Applied a total of 0 rules in 486 ms. Remains 2849 /2849 variables (removed 0) and now considering 10227/10227 (removed 0) transitions.
[2023-03-12 23:12:40] [INFO ] Invariant cache hit.
[2023-03-12 23:12:43] [INFO ] Implicit Places using invariants in 3094 ms returned []
Implicit Place search using SMT only with invariants took 3095 ms to find 0 implicit places.
[2023-03-12 23:12:43] [INFO ] Invariant cache hit.
[2023-03-12 23:12:48] [INFO ] Dead Transitions using invariants and state equation in 4919 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8507 ms. Remains : 2849/2849 places, 10227/10227 transitions.
Graph (trivial) has 8394 edges and 2849 vertex of which 1871 / 2849 are part of one of the 2 SCC in 18 ms
Free SCC test removed 1869 places
Drop transitions removed 4799 transitions
Ensure Unique test removed 2276 transitions
Reduce isomorphic transitions removed 7075 transitions.
Graph (complete) has 3454 edges and 980 vertex of which 951 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 0 output transitions
Discarding 467 places :
Symmetric choice reduction at 0 with 467 rule applications. Total rules 469 place count 484 transition count 1751
Iterating global reduction 0 with 467 rules applied. Total rules applied 936 place count 484 transition count 1751
Ensure Unique test removed 467 transitions
Reduce isomorphic transitions removed 467 transitions.
Iterating post reduction 0 with 467 rules applied. Total rules applied 1403 place count 484 transition count 1284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1405 place count 483 transition count 1283
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 1 with 56 rules applied. Total rules applied 1461 place count 483 transition count 1227
Free-agglomeration rule applied 34 times.
Iterating global reduction 1 with 34 rules applied. Total rules applied 1495 place count 483 transition count 1193
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 1552 place count 449 transition count 1170
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1558 place count 443 transition count 1164
Iterating global reduction 2 with 6 rules applied. Total rules applied 1564 place count 443 transition count 1164
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1570 place count 437 transition count 1152
Iterating global reduction 2 with 6 rules applied. Total rules applied 1576 place count 437 transition count 1152
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 1583 place count 437 transition count 1145
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1585 place count 437 transition count 1143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1587 place count 435 transition count 1143
Partial Free-agglomeration rule applied 345 times.
Drop transitions removed 345 transitions
Iterating global reduction 3 with 345 rules applied. Total rules applied 1932 place count 435 transition count 1143
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 1937 place count 435 transition count 1138
Applied a total of 1937 rules in 1416 ms. Remains 435 /2849 variables (removed 2414) and now considering 1138/10227 (removed 9089) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1138 rows 435 cols
[2023-03-12 23:12:49] [INFO ] Computed 23 place invariants in 12 ms
[2023-03-12 23:12:49] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned sat
[2023-03-12 23:12:49] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:12:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2023-03-12 23:12:50] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 23:12:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 23:12:50] [INFO ] After 441ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:12:51] [INFO ] After 888ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 298 ms.
[2023-03-12 23:12:51] [INFO ] After 1874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:12:51] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-12 23:12:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2849 places, 10227 transitions and 40543 arcs took 63 ms.
[2023-03-12 23:12:52] [INFO ] Flatten gal took : 627 ms
Total runtime 124290 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/529/inv_0_ --invariant=/tmp/529/inv_1_ --invariant=/tmp/529/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 13623628 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16075428 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
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="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-050, 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-167813695100743"
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 [ "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 ;