fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r491-tall-167912710500479
Last Updated
May 14, 2023

About the Execution of Smart+red for Szymanski-PT-b08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
590.056 247500.00 277430.00 1028.60 TTF?T?FTF??F??FT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r491-tall-167912710500479.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Szymanski-PT-b08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912710500479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M Mar 5 18:23 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 Szymanski-PT-b08-ReachabilityFireability-00
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-01
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-02
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-03
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-04
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-05
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-06
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-07
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-08
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-09
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-10
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-11
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-12
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-13
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-14
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679258487313

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=Szymanski-PT-b08
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-19 20:41:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 20:41:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 20:41:29] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2023-03-19 20:41:29] [INFO ] Transformed 568 places.
[2023-03-19 20:41:29] [INFO ] Transformed 8320 transitions.
[2023-03-19 20:41:29] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 34 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b08-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 15) seen :3
FORMULA Szymanski-PT-b08-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b08-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b08-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :1
FORMULA Szymanski-PT-b08-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-03-19 20:41:30] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 20:41:30] [INFO ] Computed 3 place invariants in 50 ms
[2023-03-19 20:41:31] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-19 20:41:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:41:32] [INFO ] After 1026ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2023-03-19 20:41:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:41:33] [INFO ] After 1055ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 20:41:33] [INFO ] After 2462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 20:41:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 33 ms returned sat
[2023-03-19 20:41:33] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:41:37] [INFO ] After 3680ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2023-03-19 20:41:52] [INFO ] After 14886ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :4 sat :6
[2023-03-19 20:41:53] [INFO ] Deduced a trap composed of 116 places in 557 ms of which 9 ms to minimize.
[2023-03-19 20:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 701 ms
[2023-03-19 20:41:53] [INFO ] Deduced a trap composed of 32 places in 525 ms of which 1 ms to minimize.
[2023-03-19 20:41:54] [INFO ] Deduced a trap composed of 46 places in 577 ms of which 2 ms to minimize.
[2023-03-19 20:41:55] [INFO ] Deduced a trap composed of 46 places in 534 ms of which 8 ms to minimize.
[2023-03-19 20:41:55] [INFO ] Deduced a trap composed of 39 places in 507 ms of which 1 ms to minimize.
[2023-03-19 20:41:56] [INFO ] Deduced a trap composed of 43 places in 451 ms of which 0 ms to minimize.
[2023-03-19 20:41:56] [INFO ] Deduced a trap composed of 73 places in 456 ms of which 0 ms to minimize.
[2023-03-19 20:41:57] [INFO ] Deduced a trap composed of 49 places in 443 ms of which 0 ms to minimize.
[2023-03-19 20:41:57] [INFO ] Deduced a trap composed of 185 places in 437 ms of which 1 ms to minimize.
[2023-03-19 20:41:58] [INFO ] Deduced a trap composed of 60 places in 402 ms of which 0 ms to minimize.
[2023-03-19 20:41:58] [INFO ] Deduced a trap composed of 73 places in 408 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-19 20:41:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 20:41:58] [INFO ] After 25095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA Szymanski-PT-b08-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b08-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b08-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b08-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 105 ms.
Support contains 50 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 306 transition count 7962
Applied a total of 103 rules in 459 ms. Remains 306 /308 variables (removed 2) and now considering 7962/8064 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 461 ms. Remains : 306/308 places, 7962/8064 transitions.
Incomplete random walk after 10004 steps, including 3 resets, run finished after 115 ms. (steps per millisecond=86 ) 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 10000 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 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 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 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 141260 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{0=1}
Probabilistic random walk after 141260 steps, saw 96137 distinct states, run finished after 3005 ms. (steps per millisecond=47 ) properties seen :1
FORMULA Szymanski-PT-b08-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
[2023-03-19 20:42:02] [INFO ] Flow matrix only has 2631 transitions (discarded 5331 similar events)
// Phase 1: matrix 2631 rows 306 cols
[2023-03-19 20:42:02] [INFO ] Computed 1 place invariants in 23 ms
[2023-03-19 20:42:02] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:42:06] [INFO ] After 3441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 20:42:06] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:42:08] [INFO ] After 2305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 20:42:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:42:25] [INFO ] After 17411ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 20:42:26] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 1 ms to minimize.
[2023-03-19 20:42:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2023-03-19 20:42:27] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 0 ms to minimize.
[2023-03-19 20:42:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-19 20:42:27] [INFO ] After 18705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 553 ms.
[2023-03-19 20:42:27] [INFO ] After 21698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 89 ms.
Support contains 14 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7962/7962 transitions.
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 306 transition count 7943
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 305 transition count 7815
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 305 transition count 7815
Applied a total of 21 rules in 401 ms. Remains 305 /306 variables (removed 1) and now considering 7815/7962 (removed 147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 305/306 places, 7815/7962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 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 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 150655 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150655 steps, saw 101004 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-19 20:42:31] [INFO ] Flow matrix only has 2611 transitions (discarded 5204 similar events)
// Phase 1: matrix 2611 rows 305 cols
[2023-03-19 20:42:31] [INFO ] Computed 1 place invariants in 19 ms
[2023-03-19 20:42:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:42:35] [INFO ] After 4314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 20:42:35] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:42:39] [INFO ] After 3894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 20:42:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:42:54] [INFO ] After 14811ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 20:42:55] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 0 ms to minimize.
[2023-03-19 20:42:55] [INFO ] Deduced a trap composed of 37 places in 306 ms of which 1 ms to minimize.
[2023-03-19 20:42:55] [INFO ] Deduced a trap composed of 42 places in 300 ms of which 1 ms to minimize.
[2023-03-19 20:42:56] [INFO ] Deduced a trap composed of 45 places in 325 ms of which 2 ms to minimize.
[2023-03-19 20:42:56] [INFO ] Deduced a trap composed of 36 places in 320 ms of which 1 ms to minimize.
[2023-03-19 20:42:56] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 0 ms to minimize.
[2023-03-19 20:42:57] [INFO ] Deduced a trap composed of 43 places in 295 ms of which 0 ms to minimize.
[2023-03-19 20:42:57] [INFO ] Deduced a trap composed of 47 places in 272 ms of which 1 ms to minimize.
[2023-03-19 20:42:57] [INFO ] Deduced a trap composed of 58 places in 279 ms of which 1 ms to minimize.
[2023-03-19 20:42:58] [INFO ] Deduced a trap composed of 72 places in 284 ms of which 0 ms to minimize.
[2023-03-19 20:42:58] [INFO ] Deduced a trap composed of 72 places in 247 ms of which 0 ms to minimize.
[2023-03-19 20:42:58] [INFO ] Deduced a trap composed of 85 places in 233 ms of which 1 ms to minimize.
[2023-03-19 20:42:58] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4207 ms
[2023-03-19 20:42:59] [INFO ] After 19841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 690 ms.
[2023-03-19 20:43:00] [INFO ] After 24548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 80 ms.
Support contains 14 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7815/7815 transitions.
Applied a total of 0 rules in 203 ms. Remains 305 /305 variables (removed 0) and now considering 7815/7815 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 305/305 places, 7815/7815 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7815/7815 transitions.
Applied a total of 0 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7815/7815 (removed 0) transitions.
[2023-03-19 20:43:00] [INFO ] Flow matrix only has 2611 transitions (discarded 5204 similar events)
[2023-03-19 20:43:00] [INFO ] Invariant cache hit.
[2023-03-19 20:43:01] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-19 20:43:01] [INFO ] Flow matrix only has 2611 transitions (discarded 5204 similar events)
[2023-03-19 20:43:01] [INFO ] Invariant cache hit.
[2023-03-19 20:43:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:43:08] [INFO ] Implicit Places using invariants and state equation in 6907 ms returned []
Implicit Place search using SMT with State Equation took 7375 ms to find 0 implicit places.
[2023-03-19 20:43:09] [INFO ] Redundant transitions in 947 ms returned []
[2023-03-19 20:43:09] [INFO ] Flow matrix only has 2611 transitions (discarded 5204 similar events)
[2023-03-19 20:43:09] [INFO ] Invariant cache hit.
[2023-03-19 20:43:11] [INFO ] Dead Transitions using invariants and state equation in 2452 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10976 ms. Remains : 305/305 places, 7815/7815 transitions.
Graph (trivial) has 3880 edges and 305 vertex of which 16 / 305 are part of one of the 7 SCC in 3 ms
Free SCC test removed 9 places
Drop transitions removed 1664 transitions
Ensure Unique test removed 3558 transitions
Reduce isomorphic transitions removed 5222 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 2 place count 296 transition count 2592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 295 transition count 2592
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 3 place count 295 transition count 2586
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 15 place count 289 transition count 2586
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 287 transition count 2584
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 287 transition count 2583
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 287 transition count 2580
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 284 transition count 2580
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 284 transition count 2579
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 284 transition count 2578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 283 transition count 2578
Applied a total of 29 rules in 396 ms. Remains 283 /305 variables (removed 22) and now considering 2578/7815 (removed 5237) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2578 rows 283 cols
[2023-03-19 20:43:12] [INFO ] Computed 1 place invariants in 22 ms
[2023-03-19 20:43:12] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:43:14] [INFO ] After 2014ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-19 20:43:14] [INFO ] After 2166ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 20:43:14] [INFO ] After 2284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 20:43:14] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:43:16] [INFO ] After 1604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 20:43:17] [INFO ] After 2517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1075 ms.
[2023-03-19 20:43:18] [INFO ] After 3690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-19 20:43:18] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-19 20:43:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7815 transitions and 31374 arcs took 31 ms.
[2023-03-19 20:43:18] [INFO ] Flatten gal took : 464 ms
Total runtime 109601 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Szymanski (PT), instance b08
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: 305 places, 7815 transitions, 31374 arcs.
Final Score: 92006.193
Took : 134 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679258734813

--------------------
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 39502:
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="Szymanski-PT-b08"
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 Szymanski-PT-b08, 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 r491-tall-167912710500479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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