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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.6K Feb 25 22:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 22:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 22:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 22:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:32 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 15M 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-100-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678800273133

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=CANConstruction-PT-100
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:24:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 13:24:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:24:35] [INFO ] Load time of PNML (sax parser for PT used): 663 ms
[2023-03-14 13:24:35] [INFO ] Transformed 21202 places.
[2023-03-14 13:24:35] [INFO ] Transformed 40800 transitions.
[2023-03-14 13:24:35] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 885 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 977 ms. (steps per millisecond=10 ) properties (out of 16) seen :3
FORMULA CANConstruction-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) 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 13) 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 13) 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 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 35 ms. (steps per millisecond=285 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-14 13:24:38] [INFO ] Computed 201 place invariants in 588 ms
[2023-03-14 13:24:45] [INFO ] After 7470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-14 13:24:53] [INFO ] [Nat]Absence check using 101 positive place invariants in 672 ms returned sat
[2023-03-14 13:24:53] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 251 ms returned sat
[2023-03-14 13:25:10] [INFO ] After 13470ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-14 13:25:11] [INFO ] State equation strengthened by 19900 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 13:25:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 13:25:11] [INFO ] After 25373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA CANConstruction-PT-100-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-100-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 240 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 669 transitions
Trivial Post-agglo rules discarded 669 transitions
Performed 669 trivial Post agglomeration. Transition count delta: 669
Iterating post reduction 0 with 669 rules applied. Total rules applied 669 place count 21202 transition count 40131
Reduce places removed 669 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 682 rules applied. Total rules applied 1351 place count 20533 transition count 40118
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1364 place count 20520 transition count 40118
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1364 place count 20520 transition count 40111
Deduced a syphon composed of 7 places in 20 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1378 place count 20513 transition count 40111
Discarding 9676 places :
Symmetric choice reduction at 3 with 9676 rule applications. Total rules 11054 place count 10837 transition count 20759
Iterating global reduction 3 with 9676 rules applied. Total rules applied 20730 place count 10837 transition count 20759
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 12 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 20910 place count 10747 transition count 20669
Free-agglomeration rule applied 52 times.
Iterating global reduction 3 with 52 rules applied. Total rules applied 20962 place count 10747 transition count 20617
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 21014 place count 10695 transition count 20617
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 21018 place count 10695 transition count 20613
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 21022 place count 10691 transition count 20613
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 5 with 149 rules applied. Total rules applied 21171 place count 10691 transition count 20613
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 21172 place count 10691 transition count 20613
Applied a total of 21172 rules in 17281 ms. Remains 10691 /21202 variables (removed 10511) and now considering 20613/40800 (removed 20187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17287 ms. Remains : 10691/21202 places, 20613/40800 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 680 ms. (steps per millisecond=14 ) properties (out of 11) seen :2
FORMULA CANConstruction-PT-100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-04 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 30 ms. (steps per millisecond=333 ) properties (out of 9) 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 9) 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 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 43 ms. (steps per millisecond=232 ) 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 39 ms. (steps per millisecond=256 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 20613 rows 10691 cols
[2023-03-14 13:25:29] [INFO ] Computed 201 place invariants in 209 ms
[2023-03-14 13:25:32] [INFO ] After 2674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 13:25:35] [INFO ] [Nat]Absence check using 101 positive place invariants in 368 ms returned sat
[2023-03-14 13:25:35] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 151 ms returned sat
[2023-03-14 13:25:57] [INFO ] After 20336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 13:25:57] [INFO ] State equation strengthened by 20059 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 13:25:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 13:25:57] [INFO ] After 25493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 224 out of 10691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10691/10691 places, 20613/20613 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 10684 transition count 20606
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 10684 transition count 20606
Applied a total of 15 rules in 10308 ms. Remains 10684 /10691 variables (removed 7) and now considering 20606/20613 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10308 ms. Remains : 10684/10691 places, 20606/20613 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) 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 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) 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 9) 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 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 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 77535 steps, run timeout after 3006 ms. (steps per millisecond=25 ) properties seen :{5=1}
Probabilistic random walk after 77535 steps, saw 76119 distinct states, run finished after 3007 ms. (steps per millisecond=25 ) properties seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 8 properties.
// Phase 1: matrix 20606 rows 10684 cols
[2023-03-14 13:26:12] [INFO ] Computed 201 place invariants in 212 ms
[2023-03-14 13:26:15] [INFO ] After 2765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 13:26:18] [INFO ] [Nat]Absence check using 101 positive place invariants in 357 ms returned sat
[2023-03-14 13:26:18] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 179 ms returned sat
[2023-03-14 13:26:39] [INFO ] After 20045ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-14 13:26:40] [INFO ] State equation strengthened by 20066 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 13:26:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 13:26:40] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 159 out of 10684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10684/10684 places, 20606/20606 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 10684 transition count 20605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10683 transition count 20605
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 10679 transition count 20597
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 10679 transition count 20597
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 60 place count 10654 transition count 20572
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 10651 transition count 20573
Applied a total of 66 rules in 15028 ms. Remains 10651 /10684 variables (removed 33) and now considering 20573/20606 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15028 ms. Remains : 10651/10684 places, 20573/20606 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 684 ms. (steps per millisecond=14 ) properties (out of 8) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 20573 rows 10651 cols
[2023-03-14 13:26:56] [INFO ] Computed 201 place invariants in 149 ms
[2023-03-14 13:26:59] [INFO ] After 2677ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 13:27:01] [INFO ] [Nat]Absence check using 101 positive place invariants in 330 ms returned sat
[2023-03-14 13:27:01] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 153 ms returned sat
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-14 13:27:24] [INFO ] After 21005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 13:27:24] [INFO ] State equation strengthened by 20098 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 13:27:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 13:27:24] [INFO ] After 25320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 144 out of 10651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10651/10651 places, 20573/20573 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 10651 transition count 20572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10650 transition count 20572
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 10644 transition count 20566
Applied a total of 14 rules in 8177 ms. Remains 10644 /10651 variables (removed 7) and now considering 20566/20573 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8177 ms. Remains : 10644/10651 places, 20566/20573 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 686 ms. (steps per millisecond=14 ) 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 25 ms. (steps per millisecond=400 ) 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 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 30 ms. (steps per millisecond=333 ) 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 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Probabilistic random walk after 151310 steps, saw 147803 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 20566 rows 10644 cols
[2023-03-14 13:27:36] [INFO ] Computed 201 place invariants in 138 ms
[2023-03-14 13:27:39] [INFO ] After 2530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 13:27:41] [INFO ] [Nat]Absence check using 101 positive place invariants in 339 ms returned sat
[2023-03-14 13:27:42] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 191 ms returned sat
[2023-03-14 13:27:59] [INFO ] After 15710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 13:27:59] [INFO ] State equation strengthened by 20104 read => feed constraints.
[2023-03-14 13:28:04] [INFO ] After 5017ms SMT Verify possible using 20104 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-14 13:28:04] [INFO ] After 5021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-14 13:28:04] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 144 out of 10644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10644/10644 places, 20566/20566 transitions.
Applied a total of 0 rules in 4121 ms. Remains 10644 /10644 variables (removed 0) and now considering 20566/20566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4121 ms. Remains : 10644/10644 places, 20566/20566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10644/10644 places, 20566/20566 transitions.
Applied a total of 0 rules in 3775 ms. Remains 10644 /10644 variables (removed 0) and now considering 20566/20566 (removed 0) transitions.
[2023-03-14 13:28:12] [INFO ] Invariant cache hit.
[2023-03-14 13:28:13] [INFO ] Implicit Places using invariants in 1148 ms returned []
Implicit Place search using SMT only with invariants took 1154 ms to find 0 implicit places.
[2023-03-14 13:28:13] [INFO ] Invariant cache hit.
[2023-03-14 13:28:14] [INFO ] Dead Transitions using invariants and state equation in 1249 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6186 ms. Remains : 10644/10644 places, 20566/20566 transitions.
Graph (trivial) has 19827 edges and 10644 vertex of which 9303 / 10644 are part of one of the 93 SCC in 17 ms
Free SCC test removed 9210 places
Drop transitions removed 18293 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18300 transitions.
Graph (complete) has 2947 edges and 1434 vertex of which 1120 are kept as prefixes of interest. Removing 314 places using SCC suffix rule.2 ms
Discarding 314 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Drop transitions removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Drop transitions removed 684 transitions
Trivial Post-agglo rules discarded 684 transitions
Performed 684 trivial Post agglomeration. Transition count delta: 684
Iterating post reduction 0 with 878 rules applied. Total rules applied 880 place count 1120 transition count 1260
Reduce places removed 684 places and 0 transitions.
Ensure Unique test removed 677 transitions
Reduce isomorphic transitions removed 677 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 1386 rules applied. Total rules applied 2266 place count 436 transition count 558
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 2291 place count 411 transition count 558
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 2291 place count 411 transition count 532
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 2345 place count 383 transition count 532
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2356 place count 372 transition count 521
Iterating global reduction 3 with 11 rules applied. Total rules applied 2367 place count 372 transition count 521
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 2367 place count 372 transition count 516
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2377 place count 367 transition count 516
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2387 place count 362 transition count 511
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 2405 place count 353 transition count 516
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 2409 place count 353 transition count 512
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 2410 place count 352 transition count 512
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2411 place count 351 transition count 511
Iterating global reduction 4 with 1 rules applied. Total rules applied 2412 place count 351 transition count 511
Free-agglomeration rule applied 45 times.
Iterating global reduction 4 with 45 rules applied. Total rules applied 2457 place count 351 transition count 466
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 4 with 45 rules applied. Total rules applied 2502 place count 306 transition count 466
Partial Free-agglomeration rule applied 44 times.
Drop transitions removed 44 transitions
Iterating global reduction 5 with 44 rules applied. Total rules applied 2546 place count 306 transition count 466
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 2579 place count 273 transition count 433
Iterating global reduction 5 with 33 rules applied. Total rules applied 2612 place count 273 transition count 433
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 5 with 23 rules applied. Total rules applied 2635 place count 250 transition count 410
Applied a total of 2635 rules in 242 ms. Remains 250 /10644 variables (removed 10394) and now considering 410/20566 (removed 20156) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 410 rows 250 cols
[2023-03-14 13:28:14] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-14 13:28:15] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 13:28:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-14 13:28:15] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-14 13:28:15] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 13:28:15] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-14 13:28:15] [INFO ] After 638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-14 13:28:15] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-14 13:28:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10644 places, 20566 transitions and 81997 arcs took 87 ms.
[2023-03-14 13:28:16] [INFO ] Flatten gal took : 883 ms
Total runtime 222121 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANConstruction (PT), instance 100
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: 10644 places, 20566 transitions, 81997 arcs.
Final Score: 8.5481981209E7
Took : 231 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: CANConstruction-PT-100-ReachabilityCardinality-00 (reachable &!potential( ( ( (tk(P5609)) <= (tk(P428)) ) | ( ( (tk(P1337)) <= (tk(P5020)) ) & ( ( ( ( (tk(P8161)) <= (tk(P6571)) ) | (! ( (tk(P8665)) <= ( 0 ) )) ) | ( ( ( ( ( (tk(P9599)) <= (tk(P2161)) ) & (! ( ( 1 ) <= (tk(P5502)) )) ) & ( (! ( (tk(P1077)) <= ( 0 ) )) & (! ( (tk(P495)) <= ( 1 ) )) ) ) & ( ( (! ( ( 1 ) <= (tk(P9745)) )) & ( (! ( (tk(P1007)) <= (tk(P4713)) )) | (! ( (tk(P211)) <= (tk(P1969)) )) ) ) & ( ( ( (tk(P337)) <= ( 1 ) ) | ( ( ( 1 ) <= (tk(P10148)) ) | (! ( (tk(P3811)) <= ( 1 ) )) ) ) & ( ( (tk(P4834)) <= ( 0 ) ) | ( (! ( (tk(P5338)) <= ( 1 ) )) & ( (tk(P5808)) <= (tk(P67)) ) ) ) ) ) ) | ( ( ( ( (tk(P4780)) <= (tk(P1594)) ) & (! ( (tk(P5815)) <= ( 1 ) )) ) & ( ( (tk(P9550)) <= ( 1 ) ) & ( (tk(P4364)) <= (tk(P10570)) ) ) ) & ( ( ( (tk(P9081)) <= (tk(P9705)) ) & ( ( (tk(P7180)) <= (tk(P2131)) ) | ( (tk(P9688)) <= ( 0 ) ) ) ) & ( ( ( ( ( 1 ) <= (tk(P7697)) ) | ( (tk(P6476)) <= (tk(P4532)) ) ) | ( ( (tk(P9811)) <= (tk(P8106)) ) | ( ( (tk(P1040)) <= (tk(P6355)) ) | ( ( ( 1 ) <= (tk(P424)) ) & ( ( ( 1 ) <= (tk(P7269)) ) & ( (tk(P287)) <= ( 1 ) ) ) ) ) ) ) & ( (! ( (tk(P10595)) <= ( 0 ) )) | (! ( ( 1 ) <= (tk(P7782)) )) ) ) ) ) ) ) & ( ( ( (tk(P4608)) <= (tk(P3878)) ) | (! ( (tk(P4208)) <= ( 1 ) )) ) | ( (! ( ( 1 ) <= (tk(P7810)) )) | ( (! ( ( 1 ) <= (tk(P1289)) )) | ( ( (! ( (tk(P3909)) <= (tk(P823)) )) & (! ( (tk(P1776)) <= (tk(P2671)) )) ) & ( ( ( 1 ) <= (tk(P1644)) ) & ( ( 1 ) <= (tk(P5637)) ) ) ) ) ) ) ) ) )))
PROPERTY: CANConstruction-PT-100-ReachabilityCardinality-01 (reachable &!potential( ( (tk(P5835)) <= (tk(P6447)) )))
PROPERTY: CANConstruction-PT-100-ReachabilityCardinality-03 (reachable & potential(( (! ( (tk(P1349)) <= (tk(P5337)) )) & (! ( ( 1 ) <= (tk(P2086)) )) )))
PROPERTY: CANConstruction-PT-100-ReachabilityCardinality-05 (reachable &!potential( (! ( ( 1 ) <= (tk(P1283)) ))))
PROPERTY: CANConstruction-PT-100-ReachabilityCardinality-07 (reachable &!potential( ( ( ( ( 1 ) <= (tk(P1396)) ) | (! ( (tk(P4182)) <= (tk(P1982)) )) ) | ( ( (tk(P8037)) <= (tk(P8278)) ) | ( ( ( (tk(P311)) <= (tk(P1048)) ) & ( ( ( 1 ) <= (tk(P8015)) ) & ( (! ( (tk(P859)) <= ( 1 ) )) | ( (! ( ( 1 ) <= (tk(P2122)) )) & (! ( ( 1 ) <= (tk(P2502)) )) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P5673)) ) | ( (! ( (tk(P9984)) <= ( 1 ) )) | ( ( (tk(P6368)) <= (tk(P10135)) ) & ( (tk(P6365)) <= (tk(P2404)) ) ) ) ) & ( ( ( (tk(P5444)) <= (tk(P317)) ) | ( (tk(P4980)) <= ( 0 ) ) ) | ( ( (tk(P6117)) <= (tk(P8803)) ) | ( (! ( (tk(P2159)) <= (tk(P1074)) )) & (! ( (tk(P9800)) <= (tk(P5875)) )) ) ) ) ) ) ) )))
PROPERTY: CANConstruction-PT-100-ReachabilityCardinality-11 (reachable & potential(( ( (! ( (tk(P8931)) <= (tk(P3827)) )) & ( (! ( (tk(P4569)) <= (tk(P10430)) )) & ( ( 1 ) <= (tk(P5292)) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P2714)) )) & ( (tk(P10623)) <= (tk(P4353)) ) ) & ( ( ( (tk(P19)) <= (tk(P1628)) ) | (! ( (tk(P7087)) <= (tk(P3407)) )) ) & ( ( ( ( 1 ) <= (tk(P8720)) ) | (! ( (tk(P4428)) <= ( 0 ) )) ) | ( ( ( (tk(P4092)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P7962)) ) ) | ( ( ( ( (tk(P1557)) <= ( 1 ) ) & ( (tk(P8455)) <= (tk(P8588)) ) ) & ( ( ( (tk(P7635)) <= (tk(P9041)) ) | ( (tk(P9269)) <= (tk(P5769)) ) ) & ( (! ( (tk(P9611)) <= (tk(P6050)) )) | ( ( ( 1 ) <= (tk(P5733)) ) | (! ( ( 1 ) <= (tk(P2946)) )) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P4073)) ) & ( (! ( ( 1 ) <= (tk(P3638)) )) & (! ( ( 1 ) <= (tk(P4191)) )) ) ) & ( (! ( ( 1 ) <= (tk(P5101)) )) & ( ( (tk(P4985)) <= ( 0 ) ) & ( (! ( (tk(P9728)) <= ( 1 ) )) | (! ( (tk(P7750)) <= (tk(P2953)) )) ) ) ) ) ) ) ) ) ) )))
PROPERTY: CANConstruction-PT-100-ReachabilityCardinality-15 (reachable & potential(( ( ( 1 ) <= (tk(P10457)) ) & ( ( (! ( (tk(P8664)) <= ( 0 ) )) | ( ( (tk(P5994)) <= (tk(P7221)) ) | ( (! ( ( 1 ) <= (tk(P8763)) )) & ( (! ( (tk(P10183)) <= ( 0 ) )) & ( (! ( ( 1 ) <= (tk(P8282)) )) | (! ( ( 1 ) <= (tk(P1617)) )) ) ) ) ) ) & ( ( ( (tk(P9180)) <= ( 1 ) ) | (! ( (tk(P2644)) <= ( 1 ) )) ) | ( ( (tk(P4044)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P2896)) ) | ( (! ( (tk(P3986)) <= (tk(P7240)) )) & ( (! ( (tk(P6687)) <= (tk(P4556)) )) & ( ( (tk(P10195)) <= ( 1 ) ) | ( ( (tk(P403)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P10554)) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 8907008 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16065532 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
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="CANConstruction-PT-100"
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 CANConstruction-PT-100, 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-167813697200694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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