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.r394-oct2-167903718000527.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 marciexred
Input is ShieldPPPs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 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.7K 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 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 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 1.8M 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-100B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679522894888

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:08:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 22:08:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:08:19] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2023-03-22 22:08:19] [INFO ] Transformed 6803 places.
[2023-03-22 22:08:19] [INFO ] Transformed 6303 transitions.
[2023-03-22 22:08:19] [INFO ] Found NUPN structural information;
[2023-03-22 22:08:19] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 752 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 767 ms. (steps per millisecond=13 ) properties (out of 16) seen :4
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 6303 rows 6803 cols
[2023-03-22 22:08:21] [INFO ] Computed 1101 place invariants in 123 ms
[2023-03-22 22:08:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 1365 ms returned sat
[2023-03-22 22:08:26] [INFO ] After 4927ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 22:08:30] [INFO ] [Nat]Absence check using 1101 positive place invariants in 911 ms returned sat
[2023-03-22 22:08:51] [INFO ] After 18993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 22:08:51] [INFO ] After 19026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 22:08:51] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 12 Parikh solutions to 2 different solutions.
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 541 ms.
Support contains 275 out of 6803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions removed 633 transitions
Trivial Post-agglo rules discarded 633 transitions
Performed 633 trivial Post agglomeration. Transition count delta: 633
Iterating post reduction 0 with 633 rules applied. Total rules applied 633 place count 6803 transition count 5670
Reduce places removed 633 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 655 rules applied. Total rules applied 1288 place count 6170 transition count 5648
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1310 place count 6148 transition count 5648
Performed 492 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 492 Pre rules applied. Total rules applied 1310 place count 6148 transition count 5156
Deduced a syphon composed of 492 places in 30 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 3 with 984 rules applied. Total rules applied 2294 place count 5656 transition count 5156
Discarding 648 places :
Symmetric choice reduction at 3 with 648 rule applications. Total rules 2942 place count 5008 transition count 4508
Iterating global reduction 3 with 648 rules applied. Total rules applied 3590 place count 5008 transition count 4508
Performed 242 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 242 Pre rules applied. Total rules applied 3590 place count 5008 transition count 4266
Deduced a syphon composed of 242 places in 34 ms
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 3 with 484 rules applied. Total rules applied 4074 place count 4766 transition count 4266
Performed 1382 Post agglomeration using F-continuation condition.Transition count delta: 1382
Deduced a syphon composed of 1382 places in 29 ms
Reduce places removed 1382 places and 0 transitions.
Iterating global reduction 3 with 2764 rules applied. Total rules applied 6838 place count 3384 transition count 2884
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 820 times.
Drop transitions removed 820 transitions
Iterating global reduction 3 with 820 rules applied. Total rules applied 7658 place count 3384 transition count 2884
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7659 place count 3383 transition count 2883
Applied a total of 7659 rules in 3074 ms. Remains 3383 /6803 variables (removed 3420) and now considering 2883/6303 (removed 3420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3075 ms. Remains : 3383/6803 places, 2883/6303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 10) seen :1
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2883 rows 3383 cols
[2023-03-22 22:08:57] [INFO ] Computed 1101 place invariants in 136 ms
[2023-03-22 22:08:58] [INFO ] [Real]Absence check using 1053 positive place invariants in 484 ms returned sat
[2023-03-22 22:08:59] [INFO ] [Real]Absence check using 1053 positive and 48 generalized place invariants in 263 ms returned sat
[2023-03-22 22:08:59] [INFO ] After 2145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 22:09:00] [INFO ] [Nat]Absence check using 1053 positive place invariants in 455 ms returned sat
[2023-03-22 22:09:00] [INFO ] [Nat]Absence check using 1053 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-22 22:09:12] [INFO ] After 11023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 22:09:15] [INFO ] Deduced a trap composed of 5 places in 2486 ms of which 33 ms to minimize.
[2023-03-22 22:09:16] [INFO ] Deduced a trap composed of 9 places in 1270 ms of which 5 ms to minimize.
[2023-03-22 22:09:17] [INFO ] Deduced a trap composed of 7 places in 1064 ms of which 7 ms to minimize.
[2023-03-22 22:09:19] [INFO ] Deduced a trap composed of 5 places in 1589 ms of which 3 ms to minimize.
[2023-03-22 22:09:20] [INFO ] Deduced a trap composed of 4 places in 1019 ms of which 15 ms to minimize.
[2023-03-22 22:09:22] [INFO ] Deduced a trap composed of 4 places in 1183 ms of which 2 ms to minimize.
[2023-03-22 22:09:23] [INFO ] Deduced a trap composed of 9 places in 1115 ms of which 27 ms to minimize.
[2023-03-22 22:09:24] [INFO ] Deduced a trap composed of 4 places in 1211 ms of which 2 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 22:09:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:09:24] [INFO ] After 25525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1800 ms.
Support contains 274 out of 3383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3383/3383 places, 2883/2883 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3383 transition count 2882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 3382 transition count 2882
Applied a total of 2 rules in 221 ms. Remains 3382 /3383 variables (removed 1) and now considering 2882/2883 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 3382/3383 places, 2882/2883 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 35969 steps, run timeout after 3002 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35969 steps, saw 34688 distinct states, run finished after 3004 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2882 rows 3382 cols
[2023-03-22 22:09:31] [INFO ] Computed 1101 place invariants in 31 ms
[2023-03-22 22:09:33] [INFO ] [Real]Absence check using 1046 positive place invariants in 976 ms returned sat
[2023-03-22 22:09:33] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 68 ms returned sat
[2023-03-22 22:09:34] [INFO ] After 2343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 22:09:36] [INFO ] [Nat]Absence check using 1046 positive place invariants in 1123 ms returned sat
[2023-03-22 22:09:36] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 31 ms returned sat
[2023-03-22 22:09:48] [INFO ] After 11255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 22:09:49] [INFO ] Deduced a trap composed of 4 places in 1046 ms of which 1 ms to minimize.
[2023-03-22 22:09:50] [INFO ] Deduced a trap composed of 12 places in 1189 ms of which 2 ms to minimize.
[2023-03-22 22:09:52] [INFO ] Deduced a trap composed of 9 places in 1210 ms of which 4 ms to minimize.
[2023-03-22 22:09:53] [INFO ] Deduced a trap composed of 7 places in 1122 ms of which 6 ms to minimize.
[2023-03-22 22:09:54] [INFO ] Deduced a trap composed of 7 places in 1343 ms of which 2 ms to minimize.
[2023-03-22 22:09:56] [INFO ] Deduced a trap composed of 11 places in 1020 ms of which 2 ms to minimize.
[2023-03-22 22:09:57] [INFO ] Deduced a trap composed of 8 places in 1545 ms of which 2 ms to minimize.
[2023-03-22 22:09:59] [INFO ] Deduced a trap composed of 8 places in 1295 ms of which 2 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 22:09:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:09:59] [INFO ] After 25118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1814 ms.
Support contains 274 out of 3382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3382/3382 places, 2882/2882 transitions.
Applied a total of 0 rules in 188 ms. Remains 3382 /3382 variables (removed 0) and now considering 2882/2882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 3382/3382 places, 2882/2882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3382/3382 places, 2882/2882 transitions.
Applied a total of 0 rules in 201 ms. Remains 3382 /3382 variables (removed 0) and now considering 2882/2882 (removed 0) transitions.
[2023-03-22 22:10:01] [INFO ] Invariant cache hit.
[2023-03-22 22:10:06] [INFO ] Implicit Places using invariants in 4980 ms returned []
[2023-03-22 22:10:06] [INFO ] Invariant cache hit.
[2023-03-22 22:10:15] [INFO ] Implicit Places using invariants and state equation in 9201 ms returned []
Implicit Place search using SMT with State Equation took 14201 ms to find 0 implicit places.
[2023-03-22 22:10:15] [INFO ] Redundant transitions in 269 ms returned []
[2023-03-22 22:10:15] [INFO ] Invariant cache hit.
[2023-03-22 22:10:19] [INFO ] Dead Transitions using invariants and state equation in 4034 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18722 ms. Remains : 3382/3382 places, 2882/2882 transitions.
Applied a total of 0 rules in 323 ms. Remains 3382 /3382 variables (removed 0) and now considering 2882/2882 (removed 0) transitions.
Running SMT prover for 9 properties.
[2023-03-22 22:10:20] [INFO ] Invariant cache hit.
[2023-03-22 22:10:21] [INFO ] [Real]Absence check using 1046 positive place invariants in 492 ms returned sat
[2023-03-22 22:10:21] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 61 ms returned sat
[2023-03-22 22:10:22] [INFO ] After 1725ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 22:10:23] [INFO ] [Nat]Absence check using 1046 positive place invariants in 324 ms returned sat
[2023-03-22 22:10:23] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 27 ms returned sat
[2023-03-22 22:10:34] [INFO ] After 10091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 22:10:35] [INFO ] Deduced a trap composed of 4 places in 1054 ms of which 2 ms to minimize.
[2023-03-22 22:10:37] [INFO ] Deduced a trap composed of 6 places in 1437 ms of which 4 ms to minimize.
[2023-03-22 22:10:38] [INFO ] Deduced a trap composed of 8 places in 1012 ms of which 2 ms to minimize.
[2023-03-22 22:10:40] [INFO ] Deduced a trap composed of 4 places in 1641 ms of which 2 ms to minimize.
[2023-03-22 22:10:42] [INFO ] Deduced a trap composed of 5 places in 2294 ms of which 1 ms to minimize.
[2023-03-22 22:10:43] [INFO ] Deduced a trap composed of 7 places in 1061 ms of which 23 ms to minimize.
[2023-03-22 22:10:45] [INFO ] Deduced a trap composed of 9 places in 1016 ms of which 2 ms to minimize.
[2023-03-22 22:10:46] [INFO ] Deduced a trap composed of 6 places in 865 ms of which 1 ms to minimize.
[2023-03-22 22:10:47] [INFO ] Deduced a trap composed of 6 places in 1065 ms of which 16 ms to minimize.
[2023-03-22 22:10:48] [INFO ] Deduced a trap composed of 4 places in 1033 ms of which 2 ms to minimize.
[2023-03-22 22:10:50] [INFO ] Deduced a trap composed of 10 places in 2047 ms of which 1 ms to minimize.
[2023-03-22 22:10:52] [INFO ] Deduced a trap composed of 8 places in 1248 ms of which 2 ms to minimize.
[2023-03-22 22:10:53] [INFO ] Deduced a trap composed of 13 places in 1747 ms of which 17 ms to minimize.
[2023-03-22 22:10:55] [INFO ] Deduced a trap composed of 10 places in 1244 ms of which 2 ms to minimize.
[2023-03-22 22:10:57] [INFO ] Deduced a trap composed of 8 places in 1891 ms of which 15 ms to minimize.
[2023-03-22 22:10:59] [INFO ] Deduced a trap composed of 11 places in 1538 ms of which 2 ms to minimize.
[2023-03-22 22:11:00] [INFO ] Deduced a trap composed of 9 places in 936 ms of which 17 ms to minimize.
[2023-03-22 22:11:01] [INFO ] Deduced a trap composed of 8 places in 1135 ms of which 14 ms to minimize.
[2023-03-22 22:11:02] [INFO ] Deduced a trap composed of 5 places in 1118 ms of which 15 ms to minimize.
[2023-03-22 22:11:04] [INFO ] Deduced a trap composed of 26 places in 1684 ms of which 2 ms to minimize.
[2023-03-22 22:11:05] [INFO ] Deduced a trap composed of 5 places in 814 ms of which 2 ms to minimize.
[2023-03-22 22:11:06] [INFO ] Deduced a trap composed of 7 places in 1218 ms of which 2 ms to minimize.
[2023-03-22 22:11:07] [INFO ] Deduced a trap composed of 15 places in 860 ms of which 2 ms to minimize.
[2023-03-22 22:11:09] [INFO ] Deduced a trap composed of 5 places in 1297 ms of which 17 ms to minimize.
[2023-03-22 22:11:11] [INFO ] Deduced a trap composed of 7 places in 2218 ms of which 14 ms to minimize.
[2023-03-22 22:11:13] [INFO ] Deduced a trap composed of 4 places in 1850 ms of which 4 ms to minimize.
[2023-03-22 22:11:15] [INFO ] Deduced a trap composed of 4 places in 1150 ms of which 16 ms to minimize.
[2023-03-22 22:11:16] [INFO ] Deduced a trap composed of 6 places in 1179 ms of which 3 ms to minimize.
[2023-03-22 22:11:18] [INFO ] Deduced a trap composed of 6 places in 1503 ms of which 1 ms to minimize.
[2023-03-22 22:11:20] [INFO ] Deduced a trap composed of 4 places in 2033 ms of which 2 ms to minimize.
[2023-03-22 22:11:21] [INFO ] Deduced a trap composed of 5 places in 1110 ms of which 2 ms to minimize.
[2023-03-22 22:11:22] [INFO ] Deduced a trap composed of 4 places in 1171 ms of which 3 ms to minimize.
[2023-03-22 22:11:24] [INFO ] Deduced a trap composed of 12 places in 1484 ms of which 3 ms to minimize.
[2023-03-22 22:11:25] [INFO ] Deduced a trap composed of 13 places in 1237 ms of which 2 ms to minimize.
[2023-03-22 22:11:27] [INFO ] Deduced a trap composed of 17 places in 1503 ms of which 3 ms to minimize.
[2023-03-22 22:11:29] [INFO ] Deduced a trap composed of 21 places in 2228 ms of which 2 ms to minimize.
[2023-03-22 22:11:31] [INFO ] Deduced a trap composed of 15 places in 1532 ms of which 2 ms to minimize.
[2023-03-22 22:11:33] [INFO ] Deduced a trap composed of 14 places in 1301 ms of which 2 ms to minimize.
[2023-03-22 22:11:34] [INFO ] Deduced a trap composed of 15 places in 1275 ms of which 19 ms to minimize.
[2023-03-22 22:11:36] [INFO ] Deduced a trap composed of 24 places in 1358 ms of which 5 ms to minimize.
[2023-03-22 22:11:37] [INFO ] Deduced a trap composed of 14 places in 1293 ms of which 16 ms to minimize.
[2023-03-22 22:11:38] [INFO ] Deduced a trap composed of 12 places in 1068 ms of which 2 ms to minimize.
[2023-03-22 22:11:39] [INFO ] Deduced a trap composed of 14 places in 1077 ms of which 1 ms to minimize.
[2023-03-22 22:11:41] [INFO ] Deduced a trap composed of 14 places in 1104 ms of which 2 ms to minimize.
[2023-03-22 22:11:42] [INFO ] Deduced a trap composed of 16 places in 944 ms of which 2 ms to minimize.
[2023-03-22 22:11:43] [INFO ] Deduced a trap composed of 15 places in 1116 ms of which 2 ms to minimize.
[2023-03-22 22:11:44] [INFO ] Deduced a trap composed of 18 places in 1055 ms of which 2 ms to minimize.
[2023-03-22 22:11:45] [INFO ] Deduced a trap composed of 15 places in 1115 ms of which 14 ms to minimize.
[2023-03-22 22:11:46] [INFO ] Deduced a trap composed of 13 places in 914 ms of which 14 ms to minimize.
[2023-03-22 22:11:48] [INFO ] Deduced a trap composed of 13 places in 1542 ms of which 2 ms to minimize.
[2023-03-22 22:11:50] [INFO ] Deduced a trap composed of 13 places in 1235 ms of which 24 ms to minimize.
[2023-03-22 22:11:51] [INFO ] Deduced a trap composed of 14 places in 1339 ms of which 4 ms to minimize.
[2023-03-22 22:11:52] [INFO ] Deduced a trap composed of 24 places in 991 ms of which 2 ms to minimize.
[2023-03-22 22:11:54] [INFO ] Deduced a trap composed of 14 places in 1279 ms of which 2 ms to minimize.
[2023-03-22 22:11:55] [INFO ] Deduced a trap composed of 17 places in 1427 ms of which 2 ms to minimize.
[2023-03-22 22:11:57] [INFO ] Deduced a trap composed of 15 places in 1806 ms of which 2 ms to minimize.
[2023-03-22 22:11:58] [INFO ] Deduced a trap composed of 16 places in 1047 ms of which 1 ms to minimize.
[2023-03-22 22:12:00] [INFO ] Deduced a trap composed of 10 places in 1073 ms of which 3 ms to minimize.
[2023-03-22 22:12:01] [INFO ] Deduced a trap composed of 15 places in 1217 ms of which 3 ms to minimize.
[2023-03-22 22:12:03] [INFO ] Deduced a trap composed of 17 places in 1465 ms of which 1 ms to minimize.
[2023-03-22 22:12:04] [INFO ] Deduced a trap composed of 15 places in 1128 ms of which 3 ms to minimize.
[2023-03-22 22:12:05] [INFO ] Deduced a trap composed of 16 places in 999 ms of which 3 ms to minimize.
[2023-03-22 22:12:06] [INFO ] Deduced a trap composed of 15 places in 841 ms of which 2 ms to minimize.
[2023-03-22 22:12:07] [INFO ] Deduced a trap composed of 13 places in 1228 ms of which 2 ms to minimize.
[2023-03-22 22:12:10] [INFO ] Deduced a trap composed of 13 places in 2266 ms of which 2 ms to minimize.
[2023-03-22 22:12:11] [INFO ] Deduced a trap composed of 15 places in 846 ms of which 2 ms to minimize.
[2023-03-22 22:12:12] [INFO ] Deduced a trap composed of 15 places in 942 ms of which 3 ms to minimize.
[2023-03-22 22:12:13] [INFO ] Deduced a trap composed of 15 places in 969 ms of which 2 ms to minimize.
[2023-03-22 22:12:14] [INFO ] Deduced a trap composed of 15 places in 1239 ms of which 2 ms to minimize.
[2023-03-22 22:12:16] [INFO ] Deduced a trap composed of 20 places in 1224 ms of which 2 ms to minimize.
[2023-03-22 22:12:18] [INFO ] Deduced a trap composed of 18 places in 1779 ms of which 2 ms to minimize.
[2023-03-22 22:12:19] [INFO ] Deduced a trap composed of 26 places in 1106 ms of which 1 ms to minimize.
[2023-03-22 22:12:20] [INFO ] Deduced a trap composed of 15 places in 1434 ms of which 3 ms to minimize.
[2023-03-22 22:12:22] [INFO ] Deduced a trap composed of 16 places in 871 ms of which 3 ms to minimize.
[2023-03-22 22:12:23] [INFO ] Deduced a trap composed of 14 places in 1068 ms of which 2 ms to minimize.
[2023-03-22 22:12:24] [INFO ] Deduced a trap composed of 18 places in 935 ms of which 3 ms to minimize.
[2023-03-22 22:12:25] [INFO ] Deduced a trap composed of 15 places in 808 ms of which 2 ms to minimize.
[2023-03-22 22:12:26] [INFO ] Deduced a trap composed of 29 places in 1274 ms of which 27 ms to minimize.
[2023-03-22 22:12:28] [INFO ] Deduced a trap composed of 16 places in 1589 ms of which 2 ms to minimize.
[2023-03-22 22:12:29] [INFO ] Deduced a trap composed of 29 places in 999 ms of which 1 ms to minimize.
[2023-03-22 22:12:31] [INFO ] Deduced a trap composed of 28 places in 1497 ms of which 2 ms to minimize.
[2023-03-22 22:12:32] [INFO ] Deduced a trap composed of 15 places in 1225 ms of which 2 ms to minimize.
[2023-03-22 22:12:33] [INFO ] Deduced a trap composed of 21 places in 905 ms of which 3 ms to minimize.
[2023-03-22 22:12:35] [INFO ] Deduced a trap composed of 41 places in 1135 ms of which 2 ms to minimize.
[2023-03-22 22:12:35] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 120800 ms
[2023-03-22 22:12:37] [INFO ] Deduced a trap composed of 4 places in 886 ms of which 3 ms to minimize.
[2023-03-22 22:12:38] [INFO ] Deduced a trap composed of 4 places in 1256 ms of which 2 ms to minimize.
[2023-03-22 22:12:40] [INFO ] Deduced a trap composed of 7 places in 1839 ms of which 2 ms to minimize.
[2023-03-22 22:12:42] [INFO ] Deduced a trap composed of 4 places in 1059 ms of which 2 ms to minimize.
[2023-03-22 22:12:43] [INFO ] Deduced a trap composed of 5 places in 897 ms of which 2 ms to minimize.
[2023-03-22 22:12:44] [INFO ] Deduced a trap composed of 8 places in 1020 ms of which 3 ms to minimize.
[2023-03-22 22:12:45] [INFO ] Deduced a trap composed of 4 places in 959 ms of which 32 ms to minimize.
[2023-03-22 22:12:46] [INFO ] Deduced a trap composed of 11 places in 1079 ms of which 6 ms to minimize.
[2023-03-22 22:12:48] [INFO ] Deduced a trap composed of 12 places in 1132 ms of which 2 ms to minimize.
[2023-03-22 22:12:49] [INFO ] Deduced a trap composed of 6 places in 688 ms of which 2 ms to minimize.
[2023-03-22 22:12:50] [INFO ] Deduced a trap composed of 10 places in 1476 ms of which 2 ms to minimize.
[2023-03-22 22:12:52] [INFO ] Deduced a trap composed of 9 places in 1639 ms of which 1 ms to minimize.
[2023-03-22 22:12:54] [INFO ] Deduced a trap composed of 7 places in 1378 ms of which 2 ms to minimize.
[2023-03-22 22:12:56] [INFO ] Deduced a trap composed of 6 places in 2264 ms of which 2 ms to minimize.
[2023-03-22 22:12:59] [INFO ] Deduced a trap composed of 7 places in 2084 ms of which 2 ms to minimize.
[2023-03-22 22:13:00] [INFO ] Deduced a trap composed of 4 places in 814 ms of which 3 ms to minimize.
[2023-03-22 22:13:01] [INFO ] Deduced a trap composed of 10 places in 1052 ms of which 2 ms to minimize.
[2023-03-22 22:13:03] [INFO ] Deduced a trap composed of 6 places in 1429 ms of which 1 ms to minimize.
[2023-03-22 22:13:04] [INFO ] Deduced a trap composed of 9 places in 935 ms of which 1 ms to minimize.
[2023-03-22 22:13:05] [INFO ] Deduced a trap composed of 6 places in 937 ms of which 1 ms to minimize.
[2023-03-22 22:13:06] [INFO ] Deduced a trap composed of 13 places in 933 ms of which 2 ms to minimize.
[2023-03-22 22:13:07] [INFO ] Deduced a trap composed of 13 places in 1283 ms of which 1 ms to minimize.
[2023-03-22 22:13:08] [INFO ] Deduced a trap composed of 20 places in 869 ms of which 2 ms to minimize.
[2023-03-22 22:13:09] [INFO ] Deduced a trap composed of 10 places in 719 ms of which 1 ms to minimize.
[2023-03-22 22:13:10] [INFO ] Deduced a trap composed of 9 places in 612 ms of which 1 ms to minimize.
[2023-03-22 22:13:11] [INFO ] Deduced a trap composed of 21 places in 1288 ms of which 1 ms to minimize.
[2023-03-22 22:13:12] [INFO ] Deduced a trap composed of 13 places in 1036 ms of which 1 ms to minimize.
[2023-03-22 22:13:14] [INFO ] Deduced a trap composed of 13 places in 1039 ms of which 2 ms to minimize.
[2023-03-22 22:13:15] [INFO ] Deduced a trap composed of 13 places in 1289 ms of which 1 ms to minimize.
[2023-03-22 22:13:16] [INFO ] Deduced a trap composed of 13 places in 552 ms of which 1 ms to minimize.
[2023-03-22 22:13:17] [INFO ] Deduced a trap composed of 16 places in 845 ms of which 1 ms to minimize.
[2023-03-22 22:13:20] [INFO ] Deduced a trap composed of 19 places in 2646 ms of which 3 ms to minimize.
[2023-03-22 22:13:20] [INFO ] Deduced a trap composed of 17 places in 600 ms of which 2 ms to minimize.
[2023-03-22 22:13:23] [INFO ] Deduced a trap composed of 16 places in 2359 ms of which 2 ms to minimize.
[2023-03-22 22:13:24] [INFO ] Deduced a trap composed of 14 places in 927 ms of which 1 ms to minimize.
[2023-03-22 22:13:25] [INFO ] Deduced a trap composed of 15 places in 497 ms of which 1 ms to minimize.
[2023-03-22 22:13:26] [INFO ] Deduced a trap composed of 26 places in 907 ms of which 1 ms to minimize.
[2023-03-22 22:13:26] [INFO ] Deduced a trap composed of 19 places in 715 ms of which 1 ms to minimize.
[2023-03-22 22:13:28] [INFO ] Deduced a trap composed of 29 places in 1239 ms of which 1 ms to minimize.
[2023-03-22 22:13:29] [INFO ] Deduced a trap composed of 31 places in 1269 ms of which 2 ms to minimize.
[2023-03-22 22:13:30] [INFO ] Deduced a trap composed of 23 places in 923 ms of which 2 ms to minimize.
[2023-03-22 22:13:32] [INFO ] Deduced a trap composed of 11 places in 1495 ms of which 32 ms to minimize.
[2023-03-22 22:13:33] [INFO ] Deduced a trap composed of 13 places in 998 ms of which 2 ms to minimize.
[2023-03-22 22:13:35] [INFO ] Deduced a trap composed of 30 places in 1152 ms of which 1 ms to minimize.
[2023-03-22 22:13:36] [INFO ] Deduced a trap composed of 14 places in 859 ms of which 2 ms to minimize.
[2023-03-22 22:13:37] [INFO ] Deduced a trap composed of 34 places in 940 ms of which 1 ms to minimize.
[2023-03-22 22:13:38] [INFO ] Deduced a trap composed of 41 places in 1338 ms of which 3 ms to minimize.
[2023-03-22 22:13:39] [INFO ] Deduced a trap composed of 8 places in 920 ms of which 3 ms to minimize.
[2023-03-22 22:13:40] [INFO ] Deduced a trap composed of 13 places in 561 ms of which 1 ms to minimize.
[2023-03-22 22:13:41] [INFO ] Deduced a trap composed of 12 places in 886 ms of which 1 ms to minimize.
[2023-03-22 22:13:42] [INFO ] Deduced a trap composed of 17 places in 859 ms of which 2 ms to minimize.
[2023-03-22 22:13:43] [INFO ] Deduced a trap composed of 11 places in 784 ms of which 1 ms to minimize.
[2023-03-22 22:13:43] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 67557 ms
[2023-03-22 22:13:50] [INFO ] Deduced a trap composed of 8 places in 1437 ms of which 1 ms to minimize.
[2023-03-22 22:13:52] [INFO ] Deduced a trap composed of 6 places in 1183 ms of which 1 ms to minimize.
[2023-03-22 22:13:53] [INFO ] Deduced a trap composed of 8 places in 974 ms of which 2 ms to minimize.
[2023-03-22 22:13:54] [INFO ] Deduced a trap composed of 6 places in 725 ms of which 1 ms to minimize.
[2023-03-22 22:13:55] [INFO ] Deduced a trap composed of 6 places in 1249 ms of which 1 ms to minimize.
[2023-03-22 22:13:56] [INFO ] Deduced a trap composed of 5 places in 1034 ms of which 1 ms to minimize.
[2023-03-22 22:13:57] [INFO ] Deduced a trap composed of 12 places in 653 ms of which 1 ms to minimize.
[2023-03-22 22:13:58] [INFO ] Deduced a trap composed of 12 places in 1047 ms of which 1 ms to minimize.
[2023-03-22 22:13:59] [INFO ] Deduced a trap composed of 7 places in 678 ms of which 1 ms to minimize.
[2023-03-22 22:14:00] [INFO ] Deduced a trap composed of 11 places in 429 ms of which 1 ms to minimize.
[2023-03-22 22:14:05] [INFO ] Deduced a trap composed of 9 places in 4985 ms of which 1 ms to minimize.
[2023-03-22 22:14:06] [INFO ] Deduced a trap composed of 7 places in 552 ms of which 1 ms to minimize.
[2023-03-22 22:14:07] [INFO ] Deduced a trap composed of 13 places in 684 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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
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 22:14:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:14:07] [INFO ] After 225188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
[2023-03-22 22:14:07] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 18 ms.
[2023-03-22 22:14:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3382 places, 2882 transitions and 12694 arcs took 25 ms.
[2023-03-22 22:14:07] [INFO ] Flatten gal took : 312 ms
Total runtime 349251 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldPPPs_PT_100B
(NrP: 3382 NrTr: 2882 NrArc: 12694)

parse formulas
formulas created successfully
place and transition orderings generation:0m 1.068sec

net check time: 0m 0.001sec

init dd package: 0m 2.971sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6277404 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16093396 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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.041sec

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-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldPPPs-PT-100B, 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 r394-oct2-167903718000527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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