Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813697300750.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CANInsertWithFailure-PT-060, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697300750
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 9.2K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K 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.0K 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 22K Feb 26 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Feb 26 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:02 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 22M 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-060-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678803403294

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-060
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 14:16:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 14:16:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:16:46] [INFO ] Load time of PNML (sax parser for PT used): 810 ms
[2023-03-14 14:16:46] [INFO ] Transformed 7924 places.
[2023-03-14 14:16:46] [INFO ] Transformed 21960 transitions.
[2023-03-14 14:16:46] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 1002 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 741 ms. (steps per millisecond=13 ) properties (out of 16) seen :2
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-04 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) 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 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 21960 rows 7924 cols
[2023-03-14 14:16:50] [INFO ] Computed 63 place invariants in 2373 ms
[2023-03-14 14:16:54] [INFO ] After 3661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-14 14:16:57] [INFO ] [Nat]Absence check using 61 positive place invariants in 138 ms returned sat
[2023-03-14 14:16:57] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 153 ms returned sat
[2023-03-14 14:17:19] [INFO ] After 19431ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-14 14:17:19] [INFO ] State equation strengthened by 7140 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 14:17:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:17:19] [INFO ] After 25259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 112 ms.
Support contains 372 out of 7924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Graph (complete) has 29701 edges and 7924 vertex of which 7923 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.41 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 357 place count 7923 transition count 21604
Reduce places removed 356 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 379 rules applied. Total rules applied 736 place count 7567 transition count 21581
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 759 place count 7544 transition count 21581
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 759 place count 7544 transition count 21572
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 777 place count 7535 transition count 21572
Performed 3201 Post agglomeration using F-continuation condition.Transition count delta: 3201
Deduced a syphon composed of 3201 places in 16 ms
Reduce places removed 3201 places and 0 transitions.
Iterating global reduction 3 with 6402 rules applied. Total rules applied 7179 place count 4334 transition count 18371
Drop transitions removed 3104 transitions
Redundant transition composition rules discarded 3104 transitions
Iterating global reduction 3 with 3104 rules applied. Total rules applied 10283 place count 4334 transition count 15267
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 10291 place count 4334 transition count 15259
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 10299 place count 4326 transition count 15259
Partial Free-agglomeration rule applied 3879 times.
Drop transitions removed 3879 transitions
Iterating global reduction 4 with 3879 rules applied. Total rules applied 14178 place count 4326 transition count 15259
Partial Free-agglomeration rule applied 411 times.
Drop transitions removed 411 transitions
Iterating global reduction 4 with 411 rules applied. Total rules applied 14589 place count 4326 transition count 15259
Applied a total of 14589 rules in 7746 ms. Remains 4326 /7924 variables (removed 3598) and now considering 15259/21960 (removed 6701) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7750 ms. Remains : 4326/7924 places, 15259/21960 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 880 ms. (steps per millisecond=11 ) properties (out of 14) seen :2
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) 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 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 41 ms. (steps per millisecond=243 ) properties (out of 12) 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 12) 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 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 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) 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 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 15259 rows 4326 cols
[2023-03-14 14:17:29] [INFO ] Computed 62 place invariants in 805 ms
[2023-03-14 14:17:31] [INFO ] After 1515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-14 14:17:32] [INFO ] [Nat]Absence check using 60 positive place invariants in 48 ms returned sat
[2023-03-14 14:17:32] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 84 ms returned sat
[2023-03-14 14:17:49] [INFO ] After 16170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-14 14:17:49] [INFO ] State equation strengthened by 12851 read => feed constraints.
[2023-03-14 14:17:56] [INFO ] After 6895ms SMT Verify possible using 12851 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-14 14:17:56] [INFO ] After 6896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-14 14:17:56] [INFO ] After 25090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 1187 ms.
Support contains 301 out of 4326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4326/4326 places, 15259/15259 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4326 transition count 15258
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 4325 transition count 15257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 4324 transition count 15257
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 5 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 72 place count 4290 transition count 15223
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 4290 transition count 15222
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 111 place count 4290 transition count 15222
Applied a total of 111 rules in 3737 ms. Remains 4290 /4326 variables (removed 36) and now considering 15222/15259 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3750 ms. Remains : 4290/4326 places, 15222/15259 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 751 ms. (steps per millisecond=13 ) properties (out of 12) seen :3
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 15222 rows 4290 cols
[2023-03-14 14:18:03] [INFO ] Computed 62 place invariants in 735 ms
[2023-03-14 14:18:05] [INFO ] After 1465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 14:18:05] [INFO ] [Nat]Absence check using 60 positive place invariants in 66 ms returned sat
[2023-03-14 14:18:06] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 73 ms returned sat
[2023-03-14 14:18:21] [INFO ] After 14412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 14:18:21] [INFO ] State equation strengthened by 13175 read => feed constraints.
[2023-03-14 14:18:30] [INFO ] After 8857ms SMT Verify possible using 13175 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-14 14:18:30] [INFO ] After 8858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-14 14:18:30] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 873 ms.
Support contains 265 out of 4290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4290/4290 places, 15222/15222 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4290 transition count 15221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4289 transition count 15221
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 34 place count 4273 transition count 15205
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 4273 transition count 15204
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 4273 transition count 15203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 4272 transition count 15203
Partial Free-agglomeration rule applied 83 times.
Drop transitions removed 83 transitions
Iterating global reduction 3 with 83 rules applied. Total rules applied 120 place count 4272 transition count 15203
Applied a total of 120 rules in 4326 ms. Remains 4272 /4290 variables (removed 18) and now considering 15203/15222 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4326 ms. Remains : 4272/4290 places, 15203/15222 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 864 ms. (steps per millisecond=11 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 45949 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 45949 steps, saw 41738 distinct states, run finished after 3003 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 15203 rows 4272 cols
[2023-03-14 14:18:40] [INFO ] Computed 62 place invariants in 710 ms
[2023-03-14 14:18:41] [INFO ] After 966ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 14:18:42] [INFO ] [Nat]Absence check using 60 positive place invariants in 54 ms returned sat
[2023-03-14 14:18:42] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 67 ms returned sat
[2023-03-14 14:18:59] [INFO ] After 16133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 14:18:59] [INFO ] State equation strengthened by 13219 read => feed constraints.
[2023-03-14 14:19:06] [INFO ] After 7185ms SMT Verify possible using 13219 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-14 14:19:06] [INFO ] After 7187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-14 14:19:06] [INFO ] After 25086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 840 ms.
Support contains 265 out of 4272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4272/4272 places, 15203/15203 transitions.
Applied a total of 0 rules in 769 ms. Remains 4272 /4272 variables (removed 0) and now considering 15203/15203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 772 ms. Remains : 4272/4272 places, 15203/15203 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4272/4272 places, 15203/15203 transitions.
Applied a total of 0 rules in 969 ms. Remains 4272 /4272 variables (removed 0) and now considering 15203/15203 (removed 0) transitions.
[2023-03-14 14:19:09] [INFO ] Invariant cache hit.
[2023-03-14 14:19:13] [INFO ] Implicit Places using invariants in 4155 ms returned []
Implicit Place search using SMT only with invariants took 4157 ms to find 0 implicit places.
[2023-03-14 14:19:13] [INFO ] Invariant cache hit.
[2023-03-14 14:19:20] [INFO ] Dead Transitions using invariants and state equation in 7453 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12585 ms. Remains : 4272/4272 places, 15203/15203 transitions.
Graph (trivial) has 12491 edges and 4272 vertex of which 2588 / 4272 are part of one of the 1 SCC in 16 ms
Free SCC test removed 2587 places
Drop transitions removed 6771 transitions
Ensure Unique test removed 3113 transitions
Reduce isomorphic transitions removed 9884 transitions.
Graph (complete) has 5775 edges and 1685 vertex of which 1534 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.1 ms
Discarding 151 places :
Also discarding 42 output transitions
Drop transitions removed 42 transitions
Drop transitions removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Iterating post reduction 0 with 547 rules applied. Total rules applied 549 place count 1534 transition count 4730
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 549 place count 1534 transition count 4725
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 559 place count 1529 transition count 4725
Discarding 709 places :
Symmetric choice reduction at 1 with 709 rule applications. Total rules 1268 place count 820 transition count 2985
Iterating global reduction 1 with 709 rules applied. Total rules applied 1977 place count 820 transition count 2985
Ensure Unique test removed 551 transitions
Reduce isomorphic transitions removed 551 transitions.
Iterating post reduction 1 with 551 rules applied. Total rules applied 2528 place count 820 transition count 2434
Discarding 117 places :
Symmetric choice reduction at 2 with 117 rule applications. Total rules 2645 place count 703 transition count 2200
Iterating global reduction 2 with 117 rules applied. Total rules applied 2762 place count 703 transition count 2200
Ensure Unique test removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Iterating post reduction 2 with 117 rules applied. Total rules applied 2879 place count 703 transition count 2083
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 2907 place count 703 transition count 2055
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 2908 place count 703 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2909 place count 702 transition count 2054
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 5 with 4 rules applied. Total rules applied 2913 place count 700 transition count 2052
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2915 place count 700 transition count 2050
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2916 place count 700 transition count 2049
Free-agglomeration rule applied 328 times with reduction of 27 identical transitions.
Iterating global reduction 6 with 328 rules applied. Total rules applied 3244 place count 700 transition count 1694
Reduce places removed 328 places and 0 transitions.
Ensure Unique test removed 416 transitions
Reduce isomorphic transitions removed 416 transitions.
Iterating post reduction 6 with 744 rules applied. Total rules applied 3988 place count 372 transition count 1278
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 7 with 38 rules applied. Total rules applied 4026 place count 372 transition count 1240
Partial Free-agglomeration rule applied 217 times.
Drop transitions removed 217 transitions
Iterating global reduction 7 with 217 rules applied. Total rules applied 4243 place count 372 transition count 1240
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 4247 place count 368 transition count 1236
Iterating global reduction 7 with 4 rules applied. Total rules applied 4251 place count 368 transition count 1236
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 4252 place count 368 transition count 1236
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 4257 place count 363 transition count 1231
Applied a total of 4257 rules in 1054 ms. Remains 363 /4272 variables (removed 3909) and now considering 1231/15203 (removed 13972) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1231 rows 363 cols
[2023-03-14 14:19:21] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-14 14:19:22] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 14:19:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-14 14:19:22] [INFO ] After 756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 14:19:23] [INFO ] After 1321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 485 ms.
[2023-03-14 14:19:24] [INFO ] After 1966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-14 14:19:24] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-14 14:19:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4272 places, 15203 transitions and 58543 arcs took 85 ms.
[2023-03-14 14:19:25] [INFO ] Flatten gal took : 660 ms
Total runtime 159654 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANInsertWithFailure (PT), instance 060
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 4272 places, 15203 transitions, 58543 arcs.
Final Score: 1.7167867818E7
Took : 215 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: CANInsertWithFailure-PT-060-ReachabilityCardinality-00 (reachable & potential(( ( ( (! ( ( 1 ) <= (tk(P2139)) )) & (! ( (tk(P453)) <= ( 1 ) )) ) & ( (! ( (tk(P1499)) <= (tk(P1176)) )) & ( ( (! ( (tk(P516)) <= ( 0 ) )) | (! ( (tk(P2529)) <= ( 0 ) )) ) & ( (! ( (tk(P2117)) <= ( 1 ) )) | (! ( (tk(P161)) <= ( 1 ) )) ) ) ) ) | ( ( ( ( (tk(P3998)) <= ( 0 ) ) & ( (tk(P497)) <= ( 1 ) ) ) & ( ( (tk(P3612)) <= ( 0 ) ) & ( (tk(P3510)) <= (tk(P1398)) ) ) ) & ( ( (! ( (tk(P1444)) <= (tk(P1395)) )) & (! ( (tk(P4173)) <= (tk(P2519)) )) ) & ( ( (! ( (tk(P2222)) <= ( 0 ) )) | ( (! ( ( 1 ) <= (tk(P2178)) )) & (! ( ( 1 ) <= (tk(P225)) )) ) ) & ( ( ( (tk(P2487)) <= ( 0 ) ) | ( (! ( (tk(P584)) <= (tk(P2478)) )) | (! ( (tk(P2656)) <= (tk(P2436)) )) ) ) & ( ( (tk(P329)) <= ( 0 ) ) | ( ( ( (tk(P2731)) <= ( 1 ) ) | ( (tk(P1550)) <= (tk(P663)) ) ) & ( ( ( 1 ) <= (tk(P1228)) ) | ( (tk(P1095)) <= (tk(P3158)) ) ) ) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-060-ReachabilityCardinality-02 (reachable &!potential( ( ( (tk(P483)) <= ( 1 ) ) | ( (tk(P3286)) <= ( 0 ) ) )))
PROPERTY: CANInsertWithFailure-PT-060-ReachabilityCardinality-03 (reachable &!potential( ( ( ( (tk(P2705)) <= (tk(P3504)) ) & ( ( ( ( (tk(P774)) <= (tk(P138)) ) | ( (tk(P2010)) <= ( 1 ) ) ) | ( ( (tk(P2576)) <= (tk(P2023)) ) | ( ( 1 ) <= (tk(P119)) ) ) ) | ( ( ( ( 1 ) <= (tk(P487)) ) | ( (tk(P1757)) <= (tk(P3913)) ) ) | ( ( (! ( ( 1 ) <= (tk(P30)) )) & ( ( (tk(P2568)) <= ( 0 ) ) | ( (tk(P1790)) <= ( 0 ) ) ) ) | ( ( ( ( ( 1 ) <= (tk(P737)) ) | ( ( (tk(P1633)) <= (tk(P4123)) ) | ( ( (tk(P2188)) <= ( 0 ) ) & ( (tk(P1918)) <= (tk(P3383)) ) ) ) ) & ( ( (tk(P3717)) <= (tk(P1296)) ) | ( ( ( 1 ) <= (tk(P2612)) ) & ( ( 1 ) <= (tk(P2759)) ) ) ) ) | ( ( ( 1 ) <= (tk(P3031)) ) & ( ( ( (tk(P770)) <= (tk(P1618)) ) | ( ( ( 1 ) <= (tk(P1799)) ) | ( ( (tk(P2749)) <= ( 1 ) ) & ( (tk(P2980)) <= ( 1 ) ) ) ) ) & ( ( (tk(P2085)) <= ( 0 ) ) | ( (tk(P345)) <= (tk(P816)) ) ) ) ) ) ) ) ) ) | ( ( (tk(P173)) <= ( 1 ) ) & ( ( ( (tk(P3159)) <= (tk(P55)) ) | (! ( (tk(P3199)) <= ( 0 ) )) ) | ( ( ( (! ( (tk(P2274)) <= ( 1 ) )) | ( (tk(P307)) <= ( 1 ) ) ) & ( (! ( (tk(P1020)) <= ( 1 ) )) | ( ( (tk(P2646)) <= (tk(P1883)) ) & ( ( (tk(P3728)) <= (tk(P1101)) ) & (! ( (tk(P3660)) <= (tk(P1669)) )) ) ) ) ) | ( ( (! ( (tk(P11)) <= ( 0 ) )) & (! ( (tk(P4161)) <= (tk(P2310)) )) ) | ( (! ( (tk(P121)) <= ( 1 ) )) & (! ( (tk(P962)) <= (tk(P1310)) )) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-060-ReachabilityCardinality-05 (reachable &!potential( ( ( (tk(P3998)) <= ( 0 ) ) | ( ( (tk(P2891)) <= (tk(P2210)) ) & ( (tk(P392)) <= (tk(P1078)) ) ) )))
PROPERTY: CANInsertWithFailure-PT-060-ReachabilityCardinality-08 (reachable &!potential( ( ( ( (tk(P3577)) <= ( 1 ) ) | ( ( ( ( 1 ) <= (tk(P2651)) ) & ( ( ( 1 ) <= (tk(P29)) ) | ( ( (tk(P3638)) <= (tk(P2587)) ) | (! ( (tk(P325)) <= (tk(P4177)) )) ) ) ) | ( (! ( (tk(P3209)) <= ( 1 ) )) & ( ( (! ( ( 1 ) <= (tk(P1471)) )) | ( ( ( 1 ) <= (tk(P3179)) ) & ( (! ( (tk(P1014)) <= ( 1 ) )) | (! ( (tk(P570)) <= (tk(P3009)) )) ) ) ) & ( ( (tk(P436)) <= (tk(P1199)) ) | ( (tk(P4121)) <= ( 0 ) ) ) ) ) ) ) | ( ( (! ( ( 1 ) <= (tk(P545)) )) & ( ( (! ( ( 1 ) <= (tk(P2248)) )) | ( ( (tk(P518)) <= (tk(P1668)) ) & ( ( 1 ) <= (tk(P2572)) ) ) ) & ( (! ( (tk(P4218)) <= ( 0 ) )) | ( ( (tk(P3576)) <= ( 0 ) ) & ( (tk(P2724)) <= ( 0 ) ) ) ) ) ) | ( ( ( ( (! ( ( 1 ) <= (tk(P4053)) )) & (! ( (tk(P3151)) <= (tk(P3074)) )) ) & ( ( (tk(P1746)) <= (tk(P2270)) ) & ( ( ( 1 ) <= (tk(P470)) ) & (! ( (tk(P303)) <= ( 1 ) )) ) ) ) & ( ( ( (! ( (tk(P2301)) <= (tk(P2235)) )) | (! ( (tk(P1347)) <= ( 1 ) )) ) & ( (! ( (tk(P1573)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P2832)) )) ) ) & ( ( ( ( 1 ) <= (tk(P384)) ) | ( (tk(P3783)) <= (tk(P3066)) ) ) & ( ( ( (tk(P4130)) <= (tk(P31)) ) | ( (tk(P1518)) <= ( 1 ) ) ) & ( ( (tk(P3722)) <= (tk(P2670)) ) | ( ( ( 1 ) <= (tk(P219)) ) & (! ( ( 1 ) <= (tk(P3494)) )) ) ) ) ) ) ) | ( (! ( (tk(P611)) <= ( 0 ) )) & ( (! ( (tk(P3768)) <= ( 1 ) )) | ( ( ( ( 1 ) <= (tk(P3716)) ) & ( ( 1 ) <= (tk(P817)) ) ) & ( ( ( 1 ) <= (tk(P457)) ) & ( ( (tk(P3206)) <= (tk(P3307)) ) & ( ( (tk(P3608)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P2041)) )) ) ) ) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-060-ReachabilityCardinality-10 (reachable &!potential( ( ( ( (tk(P1950)) <= (tk(P249)) ) | ( ( 1 ) <= (tk(P850)) ) ) | ( ( (tk(P2766)) <= (tk(P2620)) ) | ( ( 1 ) <= (tk(P1502)) ) ) )))
PROPERTY: CANInsertWithFailure-PT-060-ReachabilityCardinality-11 (reachable &!potential( ( ( ( (tk(P3073)) <= ( 1 ) ) | ( (! ( (tk(P2429)) <= ( 0 ) )) | ( ( ( ( (! ( ( 1 ) <= (tk(P4170)) )) & (! ( (tk(P4010)) <= ( 0 ) )) ) & ( (! ( (tk(P184)) <= ( 0 ) )) & ( ( (! ( ( 1 ) <= (tk(P2618)) )) | (! ( (tk(P323)) <= (tk(P542)) )) ) | ( (! ( ( 1 ) <= (tk(P3044)) )) | (! ( (tk(P1762)) <= ( 0 ) )) ) ) ) ) | ( (! ( (tk(P1833)) <= (tk(P1649)) )) & ( ( ( 1 ) <= (tk(P2002)) ) | ( (! ( ( 1 ) <= (tk(P89)) )) & (! ( (tk(P2259)) <= (tk(P4088)) )) ) ) ) ) & ( (! ( (tk(P3098)) <= (tk(P4257)) )) | ( ( ( (! ( ( 1 ) <= (tk(P837)) )) & (! ( (tk(P4128)) <= ( 0 ) )) ) & ( (! ( (tk(P2175)) <= (tk(P3933)) )) & ( (! ( (tk(P2153)) <= (tk(P2536)) )) & ( ( (tk(P1905)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P170)) ) ) ) ) ) | ( ( (tk(P2928)) <= (tk(P216)) ) & ( (tk(P1731)) <= (tk(P3380)) ) ) ) ) ) ) ) | ( ( ( ( ( (! ( (tk(P2455)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P3826)) )) ) | ( (! ( (tk(P2824)) <= (tk(P3794)) )) | ( ( (! ( (tk(P408)) <= ( 0 ) )) & ( ( (tk(P1879)) <= ( 1 ) ) & ( (tk(P3822)) <= (tk(P958)) ) ) ) | ( (! ( ( 1 ) <= (tk(P212)) )) & ( (! ( (tk(P1049)) <= ( 1 ) )) | (! ( (tk(P1915)) <= ( 0 ) )) ) ) ) ) ) & ( (! ( (tk(P1789)) <= ( 0 ) )) | ( (! ( ( 1 ) <= (tk(P3005)) )) & (! ( (tk(P891)) <= (tk(P3443)) )) ) ) ) & ( ( (! ( (tk(P4071)) <= ( 1 ) )) | ( (! ( (tk(P473)) <= ( 1 ) )) & (! ( (tk(P100)) <= (tk(P3987)) )) ) ) & ( ( ( 1 ) <= (tk(P2808)) ) | ( (! ( ( 1 ) <= (tk(P1439)) )) & (! ( (tk(P135)) <= ( 1 ) )) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P3597)) ) & ( ( (tk(P3254)) <= ( 0 ) ) | ( (tk(P3918)) <= ( 1 ) ) ) ) | ( ( (tk(P3340)) <= (tk(P1785)) ) & ( ( 1 ) <= (tk(P3334)) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-060-ReachabilityCardinality-12 (reachable &!potential( ( ( ( ( (! ( (tk(P1915)) <= ( 1 ) )) | ( (! ( (tk(P3905)) <= ( 0 ) )) | (! ( (tk(P190)) <= ( 1 ) )) ) ) | ( ( (! ( ( 1 ) <= (tk(P2673)) )) | (! ( (tk(P3647)) <= (tk(P2333)) )) ) | ( (! ( ( 1 ) <= (tk(P825)) )) | (! ( (tk(P4086)) <= (tk(P2560)) )) ) ) ) | ( ( (! ( (tk(P3907)) <= ( 1 ) )) | ( (! ( (tk(P4072)) <= (tk(P3680)) )) | ( ( (tk(P2215)) <= (tk(P3374)) ) & ( ( (! ( (tk(P2585)) <= (tk(P2516)) )) | ( ( (tk(P3377)) <= ( 0 ) ) & ( ( (tk(P3967)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P895)) ) ) ) ) | ( ( ( (tk(P2472)) <= ( 0 ) ) & ( (! ( (tk(P2275)) <= (tk(P1015)) )) & (! ( ( 1 ) <= (tk(P4105)) )) ) ) | ( ( ( 1 ) <= (tk(P3121)) ) & ( ( (tk(P269)) <= ( 1 ) ) & ( ( (tk(P2001)) <= (tk(P859)) ) | ( ( ( 1 ) <= (tk(P4088)) ) | ( ( (tk(P1402)) <= ( 0 ) ) & ( (tk(P80)) <= (tk(P2837)) ) ) ) ) ) ) ) ) ) ) ) | ( ( ( ( ( 1 ) <= (tk(P3913)) ) & ( (! ( (tk(P2046)) <= ( 0 ) )) & ( (! ( (tk(P3037)) <= ( 0 ) )) | (! ( (tk(P1728)) <= (tk(P1935)) )) ) ) ) | ( (! ( (tk(P3362)) <= ( 1 ) )) & ( (! ( (tk(P3992)) <= (tk(P1256)) )) & ( ( 1 ) <= (tk(P1091)) ) ) ) ) | ( ( (! ( (tk(P1046)) <= (tk(P1308)) )) & (! ( (tk(P695)) <= ( 1 ) )) ) | ( ( (! ( (tk(P2713)) <= (tk(P2021)) )) | (! ( (tk(P246)) <= (tk(P3381)) )) ) & ( (! ( (tk(P1785)) <= (tk(P320)) )) | (! ( (tk(P3304)) <= (tk(P1651)) )) ) ) ) ) ) ) & ( (! ( ( 1 ) <= (tk(P3133)) )) | ( ( (! ( ( 1 ) <= (tk(P4146)) )) & ( (tk(P20)) <= (tk(P1257)) ) ) | ( ( (tk(P3643)) <= ( 1 ) ) & ( ( (tk(P2558)) <= (tk(P4060)) ) & ( ( 1 ) <= (tk(P3001)) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-060-ReachabilityCardinality-13 (reachable &!potential( ( (tk(P3229)) <= ( 1 ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 14731944 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16065544 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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-060"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is CANInsertWithFailure-PT-060, 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 r043-tajo-167813697300750"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-060.tgz
mv CANInsertWithFailure-PT-060 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 ;