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.r393-oct2-167903717100510.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 888K 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 ShieldPPPs-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679456640898

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:44:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 03:44:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:44:03] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-22 03:44:03] [INFO ] Transformed 3403 places.
[2023-03-22 03:44:03] [INFO ] Transformed 3153 transitions.
[2023-03-22 03:44:03] [INFO ] Found NUPN structural information;
[2023-03-22 03:44:03] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 14) seen :6
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2023-03-22 03:44:04] [INFO ] Computed 551 place invariants in 79 ms
[2023-03-22 03:44:06] [INFO ] After 1539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 03:44:08] [INFO ] [Nat]Absence check using 551 positive place invariants in 509 ms returned sat
[2023-03-22 03:44:18] [INFO ] After 9856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 03:44:22] [INFO ] Deduced a trap composed of 27 places in 1607 ms of which 20 ms to minimize.
[2023-03-22 03:44:24] [INFO ] Deduced a trap composed of 14 places in 1656 ms of which 5 ms to minimize.
[2023-03-22 03:44:26] [INFO ] Deduced a trap composed of 23 places in 1571 ms of which 3 ms to minimize.
[2023-03-22 03:44:28] [INFO ] Deduced a trap composed of 23 places in 1506 ms of which 3 ms to minimize.
[2023-03-22 03:44:29] [INFO ] Deduced a trap composed of 26 places in 1417 ms of which 2 ms to minimize.
[2023-03-22 03:44:31] [INFO ] Deduced a trap composed of 31 places in 1679 ms of which 4 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-22 03:44:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:44:31] [INFO ] After 25071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1189 ms.
Support contains 113 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 310 place count 3403 transition count 2843
Reduce places removed 310 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 327 rules applied. Total rules applied 637 place count 3093 transition count 2826
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 654 place count 3076 transition count 2826
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 654 place count 3076 transition count 2578
Deduced a syphon composed of 248 places in 10 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 1150 place count 2828 transition count 2578
Discarding 315 places :
Symmetric choice reduction at 3 with 315 rule applications. Total rules 1465 place count 2513 transition count 2263
Iterating global reduction 3 with 315 rules applied. Total rules applied 1780 place count 2513 transition count 2263
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 1780 place count 2513 transition count 2139
Deduced a syphon composed of 124 places in 16 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 2028 place count 2389 transition count 2139
Performed 702 Post agglomeration using F-continuation condition.Transition count delta: 702
Deduced a syphon composed of 702 places in 3 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 3 with 1404 rules applied. Total rules applied 3432 place count 1687 transition count 1437
Partial Free-agglomeration rule applied 406 times.
Drop transitions removed 406 transitions
Iterating global reduction 3 with 406 rules applied. Total rules applied 3838 place count 1687 transition count 1437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3839 place count 1686 transition count 1436
Applied a total of 3839 rules in 1298 ms. Remains 1686 /3403 variables (removed 1717) and now considering 1436/3153 (removed 1717) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1299 ms. Remains : 1686/3403 places, 1436/3153 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 6) seen :1
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :1
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1436 rows 1686 cols
[2023-03-22 03:44:35] [INFO ] Computed 551 place invariants in 62 ms
[2023-03-22 03:44:35] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 03:44:35] [INFO ] [Nat]Absence check using 526 positive place invariants in 166 ms returned sat
[2023-03-22 03:44:35] [INFO ] [Nat]Absence check using 526 positive and 25 generalized place invariants in 67 ms returned sat
[2023-03-22 03:44:37] [INFO ] After 1774ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 03:44:38] [INFO ] Deduced a trap composed of 7 places in 385 ms of which 14 ms to minimize.
[2023-03-22 03:44:38] [INFO ] Deduced a trap composed of 9 places in 369 ms of which 1 ms to minimize.
[2023-03-22 03:44:39] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2023-03-22 03:44:40] [INFO ] Deduced a trap composed of 7 places in 1236 ms of which 2 ms to minimize.
[2023-03-22 03:44:41] [INFO ] Deduced a trap composed of 9 places in 449 ms of which 1 ms to minimize.
[2023-03-22 03:44:41] [INFO ] Deduced a trap composed of 6 places in 418 ms of which 14 ms to minimize.
[2023-03-22 03:44:41] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 1 ms to minimize.
[2023-03-22 03:44:42] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2023-03-22 03:44:42] [INFO ] Deduced a trap composed of 5 places in 588 ms of which 1 ms to minimize.
[2023-03-22 03:44:43] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2023-03-22 03:44:43] [INFO ] Deduced a trap composed of 8 places in 447 ms of which 1 ms to minimize.
[2023-03-22 03:44:44] [INFO ] Deduced a trap composed of 7 places in 424 ms of which 0 ms to minimize.
[2023-03-22 03:44:44] [INFO ] Deduced a trap composed of 8 places in 326 ms of which 1 ms to minimize.
[2023-03-22 03:44:45] [INFO ] Deduced a trap composed of 6 places in 390 ms of which 0 ms to minimize.
[2023-03-22 03:44:45] [INFO ] Deduced a trap composed of 10 places in 369 ms of which 1 ms to minimize.
[2023-03-22 03:44:45] [INFO ] Deduced a trap composed of 11 places in 405 ms of which 1 ms to minimize.
[2023-03-22 03:44:46] [INFO ] Deduced a trap composed of 9 places in 365 ms of which 0 ms to minimize.
[2023-03-22 03:44:46] [INFO ] Deduced a trap composed of 9 places in 435 ms of which 1 ms to minimize.
[2023-03-22 03:44:47] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 0 ms to minimize.
[2023-03-22 03:44:48] [INFO ] Deduced a trap composed of 22 places in 632 ms of which 1 ms to minimize.
[2023-03-22 03:44:48] [INFO ] Deduced a trap composed of 10 places in 353 ms of which 1 ms to minimize.
[2023-03-22 03:44:48] [INFO ] Deduced a trap composed of 7 places in 298 ms of which 0 ms to minimize.
[2023-03-22 03:44:49] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 0 ms to minimize.
[2023-03-22 03:44:49] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 1 ms to minimize.
[2023-03-22 03:44:50] [INFO ] Deduced a trap composed of 9 places in 367 ms of which 0 ms to minimize.
[2023-03-22 03:44:50] [INFO ] Deduced a trap composed of 9 places in 375 ms of which 1 ms to minimize.
[2023-03-22 03:44:51] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 1 ms to minimize.
[2023-03-22 03:44:51] [INFO ] Deduced a trap composed of 14 places in 351 ms of which 5 ms to minimize.
[2023-03-22 03:44:52] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 1 ms to minimize.
[2023-03-22 03:44:52] [INFO ] Deduced a trap composed of 10 places in 345 ms of which 0 ms to minimize.
[2023-03-22 03:44:52] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 1 ms to minimize.
[2023-03-22 03:44:53] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 1 ms to minimize.
[2023-03-22 03:44:53] [INFO ] Deduced a trap composed of 9 places in 430 ms of which 1 ms to minimize.
[2023-03-22 03:44:54] [INFO ] Deduced a trap composed of 8 places in 318 ms of which 17 ms to minimize.
[2023-03-22 03:44:54] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 0 ms to minimize.
[2023-03-22 03:44:54] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 5 ms to minimize.
[2023-03-22 03:44:55] [INFO ] Deduced a trap composed of 14 places in 454 ms of which 1 ms to minimize.
[2023-03-22 03:44:55] [INFO ] Deduced a trap composed of 10 places in 436 ms of which 0 ms to minimize.
[2023-03-22 03:44:56] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2023-03-22 03:44:56] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 1 ms to minimize.
[2023-03-22 03:44:56] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 1 ms to minimize.
[2023-03-22 03:44:57] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 0 ms to minimize.
[2023-03-22 03:44:57] [INFO ] Deduced a trap composed of 11 places in 357 ms of which 1 ms to minimize.
[2023-03-22 03:44:57] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 19858 ms
[2023-03-22 03:44:58] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 1 ms to minimize.
[2023-03-22 03:44:58] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 0 ms to minimize.
[2023-03-22 03:44:59] [INFO ] Deduced a trap composed of 8 places in 344 ms of which 1 ms to minimize.
[2023-03-22 03:44:59] [INFO ] Deduced a trap composed of 8 places in 355 ms of which 1 ms to minimize.
[2023-03-22 03:45:00] [INFO ] Deduced a trap composed of 6 places in 361 ms of which 0 ms to minimize.
[2023-03-22 03:45:00] [INFO ] Deduced a trap composed of 6 places in 421 ms of which 1 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-22 03:45:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:45:00] [INFO ] After 25195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 184 ms.
Support contains 67 out of 1686 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1686/1686 places, 1436/1436 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1686 transition count 1428
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 1678 transition count 1428
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 16 place count 1678 transition count 1417
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 38 place count 1667 transition count 1417
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 1666 transition count 1416
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 1666 transition count 1416
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 118 place count 1627 transition count 1377
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 127 place count 1627 transition count 1377
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 1626 transition count 1376
Applied a total of 128 rules in 326 ms. Remains 1626 /1686 variables (removed 60) and now considering 1376/1436 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 1626/1686 places, 1376/1436 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 70767 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70767 steps, saw 65018 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1376 rows 1626 cols
[2023-03-22 03:45:04] [INFO ] Computed 551 place invariants in 32 ms
[2023-03-22 03:45:05] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 03:45:05] [INFO ] [Nat]Absence check using 520 positive place invariants in 174 ms returned sat
[2023-03-22 03:45:05] [INFO ] [Nat]Absence check using 520 positive and 31 generalized place invariants in 23 ms returned sat
[2023-03-22 03:45:08] [INFO ] After 2919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 03:45:09] [INFO ] Deduced a trap composed of 5 places in 363 ms of which 3 ms to minimize.
[2023-03-22 03:45:09] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 1 ms to minimize.
[2023-03-22 03:45:10] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 1 ms to minimize.
[2023-03-22 03:45:10] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2023-03-22 03:45:10] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 0 ms to minimize.
[2023-03-22 03:45:11] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 1 ms to minimize.
[2023-03-22 03:45:11] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 1 ms to minimize.
[2023-03-22 03:45:11] [INFO ] Deduced a trap composed of 12 places in 331 ms of which 0 ms to minimize.
[2023-03-22 03:45:12] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2023-03-22 03:45:12] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 0 ms to minimize.
[2023-03-22 03:45:13] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 1 ms to minimize.
[2023-03-22 03:45:13] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 2 ms to minimize.
[2023-03-22 03:45:13] [INFO ] Deduced a trap composed of 6 places in 441 ms of which 11 ms to minimize.
[2023-03-22 03:45:14] [INFO ] Deduced a trap composed of 7 places in 313 ms of which 1 ms to minimize.
[2023-03-22 03:45:14] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 1 ms to minimize.
[2023-03-22 03:45:15] [INFO ] Deduced a trap composed of 7 places in 446 ms of which 1 ms to minimize.
[2023-03-22 03:45:15] [INFO ] Deduced a trap composed of 11 places in 387 ms of which 1 ms to minimize.
[2023-03-22 03:45:16] [INFO ] Deduced a trap composed of 11 places in 338 ms of which 1 ms to minimize.
[2023-03-22 03:45:16] [INFO ] Deduced a trap composed of 6 places in 357 ms of which 0 ms to minimize.
[2023-03-22 03:45:16] [INFO ] Deduced a trap composed of 8 places in 340 ms of which 26 ms to minimize.
[2023-03-22 03:45:17] [INFO ] Deduced a trap composed of 8 places in 406 ms of which 0 ms to minimize.
[2023-03-22 03:45:17] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 1 ms to minimize.
[2023-03-22 03:45:18] [INFO ] Deduced a trap composed of 11 places in 729 ms of which 1 ms to minimize.
[2023-03-22 03:45:18] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 1 ms to minimize.
[2023-03-22 03:45:19] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2023-03-22 03:45:19] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2023-03-22 03:45:19] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 1 ms to minimize.
[2023-03-22 03:45:20] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 1 ms to minimize.
[2023-03-22 03:45:20] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2023-03-22 03:45:20] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2023-03-22 03:45:21] [INFO ] Deduced a trap composed of 8 places in 350 ms of which 0 ms to minimize.
[2023-03-22 03:45:21] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 0 ms to minimize.
[2023-03-22 03:45:21] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 0 ms to minimize.
[2023-03-22 03:45:22] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2023-03-22 03:45:22] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2023-03-22 03:45:22] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 13548 ms
[2023-03-22 03:45:22] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2023-03-22 03:45:23] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 1 ms to minimize.
[2023-03-22 03:45:23] [INFO ] Deduced a trap composed of 12 places in 472 ms of which 1 ms to minimize.
[2023-03-22 03:45:24] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 1 ms to minimize.
[2023-03-22 03:45:24] [INFO ] Deduced a trap composed of 8 places in 344 ms of which 1 ms to minimize.
[2023-03-22 03:45:24] [INFO ] Deduced a trap composed of 7 places in 299 ms of which 0 ms to minimize.
[2023-03-22 03:45:25] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 0 ms to minimize.
[2023-03-22 03:45:25] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 1 ms to minimize.
[2023-03-22 03:45:26] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 0 ms to minimize.
[2023-03-22 03:45:26] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2023-03-22 03:45:26] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 1 ms to minimize.
[2023-03-22 03:45:27] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 0 ms to minimize.
[2023-03-22 03:45:27] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 1 ms to minimize.
[2023-03-22 03:45:27] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 1 ms to minimize.
[2023-03-22 03:45:28] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 0 ms to minimize.
[2023-03-22 03:45:28] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2023-03-22 03:45:28] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2023-03-22 03:45:29] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 0 ms to minimize.
[2023-03-22 03:45:29] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
[2023-03-22 03:45:29] [INFO ] Deduced a trap composed of 12 places in 423 ms of which 1 ms to minimize.
[2023-03-22 03:45:30] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 1 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-22 03:45:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:45:30] [INFO ] After 25186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 353 ms.
Support contains 67 out of 1626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1626/1626 places, 1376/1376 transitions.
Applied a total of 0 rules in 60 ms. Remains 1626 /1626 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1626/1626 places, 1376/1376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1626/1626 places, 1376/1376 transitions.
Applied a total of 0 rules in 60 ms. Remains 1626 /1626 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
[2023-03-22 03:45:30] [INFO ] Invariant cache hit.
[2023-03-22 03:45:31] [INFO ] Implicit Places using invariants in 1180 ms returned []
[2023-03-22 03:45:31] [INFO ] Invariant cache hit.
[2023-03-22 03:45:35] [INFO ] Implicit Places using invariants and state equation in 3389 ms returned []
Implicit Place search using SMT with State Equation took 4575 ms to find 0 implicit places.
[2023-03-22 03:45:35] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-22 03:45:35] [INFO ] Invariant cache hit.
[2023-03-22 03:45:36] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5840 ms. Remains : 1626/1626 places, 1376/1376 transitions.
Applied a total of 0 rules in 62 ms. Remains 1626 /1626 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 03:45:36] [INFO ] Invariant cache hit.
[2023-03-22 03:45:36] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 03:45:37] [INFO ] [Nat]Absence check using 520 positive place invariants in 117 ms returned sat
[2023-03-22 03:45:37] [INFO ] [Nat]Absence check using 520 positive and 31 generalized place invariants in 13 ms returned sat
[2023-03-22 03:45:39] [INFO ] After 1876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 03:45:40] [INFO ] Deduced a trap composed of 7 places in 751 ms of which 2 ms to minimize.
[2023-03-22 03:45:40] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 0 ms to minimize.
[2023-03-22 03:45:41] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 1 ms to minimize.
[2023-03-22 03:45:41] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 1 ms to minimize.
[2023-03-22 03:45:41] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 1 ms to minimize.
[2023-03-22 03:45:42] [INFO ] Deduced a trap composed of 6 places in 354 ms of which 1 ms to minimize.
[2023-03-22 03:45:42] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-22 03:45:43] [INFO ] Deduced a trap composed of 6 places in 751 ms of which 1 ms to minimize.
[2023-03-22 03:45:44] [INFO ] Deduced a trap composed of 8 places in 983 ms of which 1 ms to minimize.
[2023-03-22 03:45:45] [INFO ] Deduced a trap composed of 6 places in 591 ms of which 1 ms to minimize.
[2023-03-22 03:45:45] [INFO ] Deduced a trap composed of 7 places in 345 ms of which 1 ms to minimize.
[2023-03-22 03:45:46] [INFO ] Deduced a trap composed of 8 places in 347 ms of which 13 ms to minimize.
[2023-03-22 03:45:46] [INFO ] Deduced a trap composed of 6 places in 375 ms of which 0 ms to minimize.
[2023-03-22 03:45:47] [INFO ] Deduced a trap composed of 8 places in 379 ms of which 0 ms to minimize.
[2023-03-22 03:45:47] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 1 ms to minimize.
[2023-03-22 03:45:47] [INFO ] Deduced a trap composed of 8 places in 321 ms of which 1 ms to minimize.
[2023-03-22 03:45:48] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 0 ms to minimize.
[2023-03-22 03:45:48] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 1 ms to minimize.
[2023-03-22 03:45:49] [INFO ] Deduced a trap composed of 9 places in 391 ms of which 0 ms to minimize.
[2023-03-22 03:45:49] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 0 ms to minimize.
[2023-03-22 03:45:49] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 0 ms to minimize.
[2023-03-22 03:45:50] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 1 ms to minimize.
[2023-03-22 03:45:50] [INFO ] Deduced a trap composed of 8 places in 344 ms of which 1 ms to minimize.
[2023-03-22 03:45:51] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2023-03-22 03:45:51] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 1 ms to minimize.
[2023-03-22 03:45:51] [INFO ] Deduced a trap composed of 7 places in 358 ms of which 1 ms to minimize.
[2023-03-22 03:45:52] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 1 ms to minimize.
[2023-03-22 03:45:52] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 0 ms to minimize.
[2023-03-22 03:45:52] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
[2023-03-22 03:45:53] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 0 ms to minimize.
[2023-03-22 03:45:53] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2023-03-22 03:45:53] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 0 ms to minimize.
[2023-03-22 03:45:53] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 1 ms to minimize.
[2023-03-22 03:45:54] [INFO ] Deduced a trap composed of 10 places in 421 ms of which 1 ms to minimize.
[2023-03-22 03:45:54] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 15125 ms
[2023-03-22 03:45:55] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 1 ms to minimize.
[2023-03-22 03:45:55] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2023-03-22 03:45:55] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 1 ms to minimize.
[2023-03-22 03:45:56] [INFO ] Deduced a trap composed of 7 places in 384 ms of which 2 ms to minimize.
[2023-03-22 03:45:56] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2023-03-22 03:45:57] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 1 ms to minimize.
[2023-03-22 03:45:57] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 1 ms to minimize.
[2023-03-22 03:45:57] [INFO ] Deduced a trap composed of 7 places in 341 ms of which 1 ms to minimize.
[2023-03-22 03:45:58] [INFO ] Deduced a trap composed of 6 places in 372 ms of which 0 ms to minimize.
[2023-03-22 03:45:58] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 1 ms to minimize.
[2023-03-22 03:45:59] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2023-03-22 03:45:59] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 0 ms to minimize.
[2023-03-22 03:45:59] [INFO ] Deduced a trap composed of 8 places in 471 ms of which 1 ms to minimize.
[2023-03-22 03:46:00] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 1 ms to minimize.
[2023-03-22 03:46:00] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-22 03:46:00] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 0 ms to minimize.
[2023-03-22 03:46:01] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 0 ms to minimize.
[2023-03-22 03:46:01] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 1 ms to minimize.
[2023-03-22 03:46:01] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 0 ms to minimize.
[2023-03-22 03:46:02] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2023-03-22 03:46:02] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2023-03-22 03:46:02] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2023-03-22 03:46:03] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 0 ms to minimize.
[2023-03-22 03:46:03] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 0 ms to minimize.
[2023-03-22 03:46:03] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2023-03-22 03:46:04] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 0 ms to minimize.
[2023-03-22 03:46:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 26 trap constraints in 9463 ms
[2023-03-22 03:46:05] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2023-03-22 03:46:05] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-22 03:46:05] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2023-03-22 03:46:06] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2023-03-22 03:46:06] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 0 ms to minimize.
[2023-03-22 03:46:07] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2023-03-22 03:46:07] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 1 ms to minimize.
[2023-03-22 03:46:07] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2023-03-22 03:46:08] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 0 ms to minimize.
[2023-03-22 03:46:08] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2023-03-22 03:46:08] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-22 03:46:08] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2023-03-22 03:46:09] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-22 03:46:09] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 1 ms to minimize.
[2023-03-22 03:46:09] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2023-03-22 03:46:10] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2023-03-22 03:46:10] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2023-03-22 03:46:10] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 0 ms to minimize.
[2023-03-22 03:46:10] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5740 ms
[2023-03-22 03:46:11] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 1 ms to minimize.
[2023-03-22 03:46:12] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 1 ms to minimize.
[2023-03-22 03:46:12] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 1 ms to minimize.
[2023-03-22 03:46:12] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2023-03-22 03:46:13] [INFO ] Deduced a trap composed of 13 places in 458 ms of which 0 ms to minimize.
[2023-03-22 03:46:13] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 1 ms to minimize.
[2023-03-22 03:46:13] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 0 ms to minimize.
[2023-03-22 03:46:14] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 0 ms to minimize.
[2023-03-22 03:46:14] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 1 ms to minimize.
[2023-03-22 03:46:14] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 1 ms to minimize.
[2023-03-22 03:46:15] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2023-03-22 03:46:15] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 0 ms to minimize.
[2023-03-22 03:46:15] [INFO ] Deduced a trap composed of 7 places in 281 ms of which 1 ms to minimize.
[2023-03-22 03:46:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4384 ms
[2023-03-22 03:46:15] [INFO ] After 38316ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 1455 ms.
[2023-03-22 03:46:17] [INFO ] After 40382ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2023-03-22 03:46:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 51 ms.
[2023-03-22 03:46:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1626 places, 1376 transitions and 6278 arcs took 7 ms.
[2023-03-22 03:46:17] [INFO ] Flatten gal took : 198 ms
Total runtime 134423 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/1126/inv_0_ --invariant=/tmp/1126/inv_1_ --invariant=/tmp/1126/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12553400 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16092276 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-PT-050B, 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 r393-oct2-167903717100510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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