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-167813697200671.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-070, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697200671
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K Feb 25 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 21:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 14K Feb 25 22:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 22:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 22:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:24 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 7.3M 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-070-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678799203007

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-070
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:06:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 13:06:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:06:45] [INFO ] Load time of PNML (sax parser for PT used): 474 ms
[2023-03-14 13:06:45] [INFO ] Transformed 10642 places.
[2023-03-14 13:06:45] [INFO ] Transformed 20160 transitions.
[2023-03-14 13:06:45] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 727 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 8 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 16) seen :4
FORMULA CANConstruction-PT-070-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 52 ms. (steps per millisecond=192 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 20160 rows 10642 cols
[2023-03-14 13:06:47] [INFO ] Computed 141 place invariants in 292 ms
[2023-03-14 13:06:50] [INFO ] [Real]Absence check using 71 positive place invariants in 247 ms returned sat
[2023-03-14 13:06:51] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 83 ms returned sat
[2023-03-14 13:06:51] [INFO ] After 4332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-14 13:06:55] [INFO ] [Nat]Absence check using 71 positive place invariants in 275 ms returned sat
[2023-03-14 13:06:55] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 122 ms returned sat
[2023-03-14 13:07:16] [INFO ] After 18999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-14 13:07:16] [INFO ] State equation strengthened by 9730 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:07:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 13:07:16] [INFO ] After 25217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 202 out of 10642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 10642 transition count 19752
Reduce places removed 408 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 410 rules applied. Total rules applied 818 place count 10234 transition count 19750
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 820 place count 10232 transition count 19750
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 820 place count 10232 transition count 19723
Deduced a syphon composed of 27 places in 11 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 874 place count 10205 transition count 19723
Discarding 4678 places :
Symmetric choice reduction at 3 with 4678 rule applications. Total rules 5552 place count 5527 transition count 10367
Iterating global reduction 3 with 4678 rules applied. Total rules applied 10230 place count 5527 transition count 10367
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 5 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 10314 place count 5485 transition count 10325
Free-agglomeration rule applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 10353 place count 5485 transition count 10286
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 10392 place count 5446 transition count 10286
Free-agglomeration rule (complex) applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 10440 place count 5446 transition count 10238
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 10488 place count 5398 transition count 10238
Partial Free-agglomeration rule applied 126 times.
Drop transitions removed 126 transitions
Iterating global reduction 5 with 126 rules applied. Total rules applied 10614 place count 5398 transition count 10238
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 10631 place count 5398 transition count 10238
Applied a total of 10631 rules in 8139 ms. Remains 5398 /10642 variables (removed 5244) and now considering 10238/20160 (removed 9922) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8143 ms. Remains : 5398/10642 places, 10238/20160 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 12) seen :5
FORMULA CANConstruction-PT-070-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :1
FORMULA CANConstruction-PT-070-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10238 rows 5398 cols
[2023-03-14 13:07:25] [INFO ] Computed 141 place invariants in 97 ms
[2023-03-14 13:07:27] [INFO ] [Real]Absence check using 71 positive place invariants in 162 ms returned sat
[2023-03-14 13:07:27] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 68 ms returned sat
[2023-03-14 13:07:27] [INFO ] After 2055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 13:07:29] [INFO ] [Nat]Absence check using 71 positive place invariants in 153 ms returned sat
[2023-03-14 13:07:29] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 67 ms returned sat
[2023-03-14 13:07:35] [INFO ] After 5795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 13:07:35] [INFO ] State equation strengthened by 9847 read => feed constraints.
[2023-03-14 13:07:43] [INFO ] After 7265ms SMT Verify possible using 9847 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-14 13:07:48] [INFO ] After 12883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 4036 ms.
[2023-03-14 13:07:52] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA CANConstruction-PT-070-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 124 ms.
Support contains 91 out of 5398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5398/5398 places, 10238/10238 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 5398 transition count 10235
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 5395 transition count 10235
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 18 place count 5383 transition count 10211
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 5383 transition count 10211
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 108 place count 5344 transition count 10172
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 126 place count 5335 transition count 10175
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 5335 transition count 10173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 5333 transition count 10173
Applied a total of 130 rules in 4768 ms. Remains 5333 /5398 variables (removed 65) and now considering 10173/10238 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4768 ms. Remains : 5333/5398 places, 10173/10238 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 91533 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91533 steps, saw 83312 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10173 rows 5333 cols
[2023-03-14 13:08:01] [INFO ] Computed 141 place invariants in 117 ms
[2023-03-14 13:08:02] [INFO ] [Real]Absence check using 71 positive place invariants in 161 ms returned sat
[2023-03-14 13:08:02] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 67 ms returned sat
[2023-03-14 13:08:03] [INFO ] After 1908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:08:04] [INFO ] [Nat]Absence check using 71 positive place invariants in 135 ms returned sat
[2023-03-14 13:08:04] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 64 ms returned sat
[2023-03-14 13:08:10] [INFO ] After 5503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 13:08:10] [INFO ] State equation strengthened by 9897 read => feed constraints.
[2023-03-14 13:08:15] [INFO ] After 5010ms SMT Verify possible using 9897 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-14 13:08:20] [INFO ] After 9407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3106 ms.
[2023-03-14 13:08:23] [INFO ] After 19962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 91 out of 5333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5333/5333 places, 10173/10173 transitions.
Applied a total of 0 rules in 1039 ms. Remains 5333 /5333 variables (removed 0) and now considering 10173/10173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1040 ms. Remains : 5333/5333 places, 10173/10173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5333/5333 places, 10173/10173 transitions.
Applied a total of 0 rules in 909 ms. Remains 5333 /5333 variables (removed 0) and now considering 10173/10173 (removed 0) transitions.
[2023-03-14 13:08:25] [INFO ] Invariant cache hit.
[2023-03-14 13:08:29] [INFO ] Implicit Places using invariants in 3634 ms returned []
Implicit Place search using SMT only with invariants took 3636 ms to find 0 implicit places.
[2023-03-14 13:08:29] [INFO ] Invariant cache hit.
[2023-03-14 13:08:34] [INFO ] Dead Transitions using invariants and state equation in 5747 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10295 ms. Remains : 5333/5333 places, 10173/10173 transitions.
Graph (trivial) has 8721 edges and 5333 vertex of which 3816 / 5333 are part of one of the 54 SCC in 8 ms
Free SCC test removed 3762 places
Drop transitions removed 7443 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 7454 transitions.
Graph (complete) has 3191 edges and 1571 vertex of which 1419 are kept as prefixes of interest. Removing 152 places using SCC suffix rule.2 ms
Discarding 152 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Ensure Unique test removed 6 places
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 1413 transition count 2488
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Performed 1042 Post agglomeration using F-continuation condition.Transition count delta: 1042
Iterating post reduction 1 with 1179 rules applied. Total rules applied 1350 place count 1344 transition count 1378
Reduce places removed 1042 places and 0 transitions.
Ensure Unique test removed 1007 transitions
Reduce isomorphic transitions removed 1007 transitions.
Iterating post reduction 2 with 2049 rules applied. Total rules applied 3399 place count 302 transition count 371
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 3399 place count 302 transition count 345
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 3451 place count 276 transition count 345
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 3472 place count 255 transition count 324
Iterating global reduction 3 with 21 rules applied. Total rules applied 3493 place count 255 transition count 324
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 3501 place count 255 transition count 316
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3501 place count 255 transition count 315
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3503 place count 254 transition count 315
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3507 place count 252 transition count 313
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3509 place count 251 transition count 314
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 3518 place count 251 transition count 305
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 3555 place count 251 transition count 268
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 3611 place count 207 transition count 256
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 3618 place count 207 transition count 249
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 3625 place count 200 transition count 249
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 3643 place count 200 transition count 249
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 3658 place count 185 transition count 234
Iterating global reduction 6 with 15 rules applied. Total rules applied 3673 place count 185 transition count 234
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 3676 place count 182 transition count 231
Applied a total of 3676 rules in 258 ms. Remains 182 /5333 variables (removed 5151) and now considering 231/10173 (removed 9942) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 231 rows 182 cols
[2023-03-14 13:08:35] [INFO ] Computed 49 place invariants in 1 ms
[2023-03-14 13:08:35] [INFO ] [Real]Absence check using 49 positive place invariants in 5 ms returned sat
[2023-03-14 13:08:35] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:08:35] [INFO ] [Nat]Absence check using 49 positive place invariants in 4 ms returned sat
[2023-03-14 13:08:35] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 13:08:35] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-14 13:08:35] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-14 13:08:35] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-14 13:08:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5333 places, 10173 transitions and 40591 arcs took 66 ms.
[2023-03-14 13:08:36] [INFO ] Flatten gal took : 506 ms
Total runtime 111729 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANConstruction (PT), instance 070
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 5333 places, 10173 transitions, 40591 arcs.
Final Score: 1.3534400427E7
Took : 121 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678799438931

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 56174:
syntax error

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-070"
export BK_EXAMINATION="ReachabilityFireability"
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-070, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813697200671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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