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-167813695000678.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 CANConstruction-PT-080, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 11K Feb 25 22:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 9.5M 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 CANConstruction-PT-080-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678656066548

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-080
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:21:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 21:21:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:21:08] [INFO ] Load time of PNML (sax parser for PT used): 472 ms
[2023-03-12 21:21:08] [INFO ] Transformed 13762 places.
[2023-03-12 21:21:08] [INFO ] Transformed 26240 transitions.
[2023-03-12 21:21:08] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 615 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 696 ms. (steps per millisecond=14 ) properties (out of 16) seen :3
FORMULA CANConstruction-PT-080-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 26240 rows 13762 cols
[2023-03-12 21:21:10] [INFO ] Computed 161 place invariants in 397 ms
[2023-03-12 21:21:15] [INFO ] After 4336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 21:21:19] [INFO ] [Nat]Absence check using 81 positive place invariants in 374 ms returned sat
[2023-03-12 21:21:19] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 109 ms returned sat
[2023-03-12 21:21:40] [INFO ] After 17835ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-12 21:21:40] [INFO ] State equation strengthened by 12720 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 21:21:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:21:40] [INFO ] After 25278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA CANConstruction-PT-080-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-080-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 237 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions removed 524 transitions
Trivial Post-agglo rules discarded 524 transitions
Performed 524 trivial Post agglomeration. Transition count delta: 524
Iterating post reduction 0 with 524 rules applied. Total rules applied 524 place count 13762 transition count 25716
Reduce places removed 524 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 537 rules applied. Total rules applied 1061 place count 13238 transition count 25703
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1074 place count 13225 transition count 25703
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1074 place count 13225 transition count 25697
Deduced a syphon composed of 6 places in 13 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1086 place count 13219 transition count 25697
Discarding 6132 places :
Symmetric choice reduction at 3 with 6132 rule applications. Total rules 7218 place count 7087 transition count 13433
Iterating global reduction 3 with 6132 rules applied. Total rules applied 13350 place count 7087 transition count 13433
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 6 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 13490 place count 7017 transition count 13363
Free-agglomeration rule applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 13529 place count 7017 transition count 13324
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 13568 place count 6978 transition count 13324
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 13573 place count 6978 transition count 13319
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 13578 place count 6973 transition count 13319
Partial Free-agglomeration rule applied 124 times.
Drop transitions removed 124 transitions
Iterating global reduction 5 with 124 rules applied. Total rules applied 13702 place count 6973 transition count 13319
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 13707 place count 6973 transition count 13319
Applied a total of 13707 rules in 13621 ms. Remains 6973 /13762 variables (removed 6789) and now considering 13319/26240 (removed 12921) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13625 ms. Remains : 6973/13762 places, 13319/26240 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 11) seen :4
FORMULA CANConstruction-PT-080-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 13319 rows 6973 cols
[2023-03-12 21:21:54] [INFO ] Computed 161 place invariants in 117 ms
[2023-03-12 21:21:56] [INFO ] [Real]Absence check using 81 positive place invariants in 150 ms returned sat
[2023-03-12 21:21:56] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 129 ms returned sat
[2023-03-12 21:21:56] [INFO ] After 1819ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 21:21:58] [INFO ] [Nat]Absence check using 81 positive place invariants in 207 ms returned sat
[2023-03-12 21:21:58] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 85 ms returned sat
[2023-03-12 21:22:07] [INFO ] After 8680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 21:22:08] [INFO ] State equation strengthened by 12847 read => feed constraints.
[2023-03-12 21:22:16] [INFO ] After 8618ms SMT Verify possible using 12847 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 21:22:21] [INFO ] After 13760ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 21:22:21] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA CANConstruction-PT-080-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 129 ms.
Support contains 2 out of 6973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6973/6973 places, 13319/13319 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 6973 transition count 13311
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 6965 transition count 13311
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 63 place count 6918 transition count 13217
Iterating global reduction 2 with 47 rules applied. Total rules applied 110 place count 6918 transition count 13217
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 194 place count 6876 transition count 13175
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 256 place count 6845 transition count 13191
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 6845 transition count 13190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 6844 transition count 13190
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 6844 transition count 13190
Applied a total of 262 rules in 10538 ms. Remains 6844 /6973 variables (removed 129) and now considering 13190/13319 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10539 ms. Remains : 6844/6973 places, 13190/13319 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 86281 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86281 steps, saw 74607 distinct states, run finished after 3004 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 13190 rows 6844 cols
[2023-03-12 21:22:36] [INFO ] Computed 161 place invariants in 99 ms
[2023-03-12 21:22:37] [INFO ] After 956ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:22:37] [INFO ] [Nat]Absence check using 81 positive place invariants in 165 ms returned sat
[2023-03-12 21:22:38] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 86 ms returned sat
[2023-03-12 21:22:45] [INFO ] After 7143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:22:45] [INFO ] State equation strengthened by 12966 read => feed constraints.
[2023-03-12 21:22:47] [INFO ] After 1711ms SMT Verify possible using 12966 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:22:48] [INFO ] After 2854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 877 ms.
[2023-03-12 21:22:49] [INFO ] After 12384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 7 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
FORMULA CANConstruction-PT-080-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 4 ms.
All properties solved without resorting to model-checking.
Total runtime 101104 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/502/inv_0_ --invariant=/tmp/502/inv_1_ --invariant=/tmp/502/inv_2_ --invariant=/tmp/502/inv_3_ --invariant=/tmp/502/inv_4_ --invariant=/tmp/502/inv_5_ --invariant=/tmp/502/inv_6_ --invariant=/tmp/502/inv_7_ --invariant=/tmp/502/inv_8_ --invariant=/tmp/502/inv_9_ --invariant=/tmp/502/inv_10_ --invariant=/tmp/502/inv_11_ --invariant=/tmp/502/inv_12_ --invariant=/tmp/502/inv_13_ --invariant=/tmp/502/inv_14_ --invariant=/tmp/502/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 164812 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16256728 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-080"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-080, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695000678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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