About the Execution of 2023-gold for PolyORBNT-COL-S05J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6602.703 | 200911.00 | 263922.00 | 217.90 | TFFTFTTTTFTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460800245.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-COL-S05J60, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460800245
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 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 PolyORBNT-COL-S05J60-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717127425000
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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-31 03:50:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 03:50:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:50:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 03:50:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 03:50:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 718 ms
[2024-05-31 03:50:28] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 03:50:28] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-31 03:50:28] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 2 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 8357 steps, including 670 resets, run visited all 4 properties in 219 ms. (steps per millisecond=38 )
[2024-05-31 03:50:29] [INFO ] Flatten gal took : 87 ms
[2024-05-31 03:50:29] [INFO ] Flatten gal took : 7 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-31 03:50:29] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 97 ms.
[2024-05-31 03:50:29] [INFO ] Unfolded 16 HLPN properties in 13 ms.
[2024-05-31 03:50:29] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-31 03:50:29] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-31 03:50:29] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-31 03:50:29] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-31 03:50:29] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-31 03:50:29] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-31 03:50:29] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-31 03:50:29] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 60 places in 9 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 685 resets, run finished after 838 ms. (steps per millisecond=11 ) properties (out of 16) seen :6
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 222 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 127 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 274 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 249 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 992 ms. (steps per millisecond=10 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-31 03:50:33] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-31 03:50:34] [INFO ] Computed 142 invariants in 125 ms
[2024-05-31 03:50:41] [INFO ] [Real]Absence check using 135 positive place invariants in 136 ms returned sat
[2024-05-31 03:50:41] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 50 ms returned sat
[2024-05-31 03:50:41] [INFO ] After 1176ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2024-05-31 03:50:41] [INFO ] [Nat]Absence check using 135 positive place invariants in 47 ms returned sat
[2024-05-31 03:50:41] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-31 03:50:43] [INFO ] After 1459ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :2
[2024-05-31 03:50:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:50:44] [INFO ] After 625ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :8 sat :2
[2024-05-31 03:50:44] [INFO ] After 1046ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :2
Attempting to minimize the solution found.
Minimization took 189 ms.
[2024-05-31 03:50:44] [INFO ] After 3416ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :2
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 904 transition count 1250
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 136 place count 839 transition count 1249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 137 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 271 place count 771 transition count 1182
Applied a total of 271 rules in 652 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
[2024-05-31 03:50:45] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2024-05-31 03:50:45] [INFO ] Computed 137 invariants in 270 ms
[2024-05-31 03:50:46] [INFO ] Dead Transitions using invariants and state equation in 1512 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 771/909 places, 1087/1315 transitions.
Applied a total of 0 rules in 64 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2231 ms. Remains : 771/909 places, 1087/1315 transitions.
Incomplete random walk after 10000 steps, including 476 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 03:50:47] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2024-05-31 03:50:47] [INFO ] Computed 137 invariants in 27 ms
[2024-05-31 03:50:47] [INFO ] [Real]Absence check using 130 positive place invariants in 29 ms returned sat
[2024-05-31 03:50:47] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 38 ms returned sat
[2024-05-31 03:50:47] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:50:47] [INFO ] [Nat]Absence check using 130 positive place invariants in 38 ms returned sat
[2024-05-31 03:50:47] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-31 03:50:48] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:50:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:50:48] [INFO ] After 445ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 03:50:49] [INFO ] Deduced a trap composed of 266 places in 402 ms of which 2 ms to minimize.
[2024-05-31 03:50:49] [INFO ] Deduced a trap composed of 248 places in 548 ms of which 3 ms to minimize.
[2024-05-31 03:50:50] [INFO ] Deduced a trap composed of 254 places in 324 ms of which 2 ms to minimize.
[2024-05-31 03:50:50] [INFO ] Deduced a trap composed of 234 places in 336 ms of which 1 ms to minimize.
[2024-05-31 03:50:55] [INFO ] Deduced a trap composed of 251 places in 4634 ms of which 26 ms to minimize.
[2024-05-31 03:50:55] [INFO ] Deduced a trap composed of 239 places in 561 ms of which 2 ms to minimize.
[2024-05-31 03:50:56] [INFO ] Deduced a trap composed of 230 places in 324 ms of which 2 ms to minimize.
[2024-05-31 03:50:56] [INFO ] Deduced a trap composed of 258 places in 454 ms of which 2 ms to minimize.
[2024-05-31 03:50:57] [INFO ] Deduced a trap composed of 239 places in 329 ms of which 1 ms to minimize.
[2024-05-31 03:50:58] [INFO ] Deduced a trap composed of 248 places in 342 ms of which 1 ms to minimize.
[2024-05-31 03:50:58] [INFO ] Deduced a trap composed of 218 places in 335 ms of which 1 ms to minimize.
[2024-05-31 03:50:59] [INFO ] Deduced a trap composed of 236 places in 540 ms of which 1 ms to minimize.
[2024-05-31 03:50:59] [INFO ] Deduced a trap composed of 251 places in 335 ms of which 1 ms to minimize.
[2024-05-31 03:50:59] [INFO ] Deduced a trap composed of 230 places in 308 ms of which 1 ms to minimize.
[2024-05-31 03:51:00] [INFO ] Deduced a trap composed of 239 places in 550 ms of which 2 ms to minimize.
[2024-05-31 03:51:01] [INFO ] Deduced a trap composed of 230 places in 489 ms of which 2 ms to minimize.
[2024-05-31 03:51:01] [INFO ] Deduced a trap composed of 242 places in 382 ms of which 1 ms to minimize.
[2024-05-31 03:51:01] [INFO ] Deduced a trap composed of 263 places in 358 ms of which 1 ms to minimize.
[2024-05-31 03:51:02] [INFO ] Deduced a trap composed of 236 places in 335 ms of which 1 ms to minimize.
[2024-05-31 03:51:04] [INFO ] Deduced a trap composed of 242 places in 384 ms of which 1 ms to minimize.
[2024-05-31 03:51:04] [INFO ] Deduced a trap composed of 236 places in 384 ms of which 2 ms to minimize.
[2024-05-31 03:51:05] [INFO ] Deduced a trap composed of 245 places in 402 ms of which 1 ms to minimize.
[2024-05-31 03:51:05] [INFO ] Deduced a trap composed of 251 places in 423 ms of which 1 ms to minimize.
[2024-05-31 03:51:06] [INFO ] Deduced a trap composed of 239 places in 376 ms of which 1 ms to minimize.
[2024-05-31 03:51:06] [INFO ] Deduced a trap composed of 254 places in 378 ms of which 1 ms to minimize.
[2024-05-31 03:51:07] [INFO ] Deduced a trap composed of 245 places in 371 ms of which 1 ms to minimize.
[2024-05-31 03:51:07] [INFO ] Deduced a trap composed of 242 places in 326 ms of which 1 ms to minimize.
[2024-05-31 03:51:08] [INFO ] Deduced a trap composed of 254 places in 389 ms of which 1 ms to minimize.
[2024-05-31 03:51:08] [INFO ] Deduced a trap composed of 230 places in 382 ms of which 1 ms to minimize.
[2024-05-31 03:51:10] [INFO ] Deduced a trap composed of 248 places in 359 ms of which 1 ms to minimize.
[2024-05-31 03:51:11] [INFO ] Deduced a trap composed of 230 places in 364 ms of which 1 ms to minimize.
[2024-05-31 03:51:12] [INFO ] Deduced a trap composed of 233 places in 339 ms of which 1 ms to minimize.
[2024-05-31 03:51:12] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 23862 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 03:51:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 03:51:12] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 771 transition count 1086
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 770 transition count 1086
Applied a total of 2 rules in 73 ms. Remains 770 /771 variables (removed 1) and now considering 1086/1087 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 770/771 places, 1086/1087 transitions.
Incomplete random walk after 10000 steps, including 520 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 325269 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325269 steps, saw 98927 distinct states, run finished after 3002 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 03:51:15] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 03:51:15] [INFO ] Computed 137 invariants in 45 ms
[2024-05-31 03:51:15] [INFO ] [Real]Absence check using 130 positive place invariants in 48 ms returned sat
[2024-05-31 03:51:15] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 03:51:16] [INFO ] After 345ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 03:51:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:51:16] [INFO ] After 118ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:51:16] [INFO ] After 701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:51:16] [INFO ] [Nat]Absence check using 130 positive place invariants in 49 ms returned sat
[2024-05-31 03:51:16] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 54 ms returned sat
[2024-05-31 03:51:17] [INFO ] After 657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:51:17] [INFO ] After 427ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 03:51:18] [INFO ] Deduced a trap composed of 240 places in 540 ms of which 27 ms to minimize.
[2024-05-31 03:51:18] [INFO ] Deduced a trap composed of 252 places in 321 ms of which 1 ms to minimize.
[2024-05-31 03:51:19] [INFO ] Deduced a trap composed of 252 places in 335 ms of which 1 ms to minimize.
[2024-05-31 03:51:19] [INFO ] Deduced a trap composed of 227 places in 318 ms of which 0 ms to minimize.
[2024-05-31 03:51:20] [INFO ] Deduced a trap composed of 239 places in 352 ms of which 2 ms to minimize.
[2024-05-31 03:51:20] [INFO ] Deduced a trap composed of 240 places in 364 ms of which 1 ms to minimize.
[2024-05-31 03:51:20] [INFO ] Deduced a trap composed of 242 places in 292 ms of which 3 ms to minimize.
[2024-05-31 03:51:21] [INFO ] Deduced a trap composed of 227 places in 363 ms of which 1 ms to minimize.
[2024-05-31 03:51:21] [INFO ] Deduced a trap composed of 254 places in 297 ms of which 1 ms to minimize.
[2024-05-31 03:51:21] [INFO ] Deduced a trap composed of 242 places in 305 ms of which 1 ms to minimize.
[2024-05-31 03:51:22] [INFO ] Deduced a trap composed of 242 places in 360 ms of which 1 ms to minimize.
[2024-05-31 03:51:22] [INFO ] Deduced a trap composed of 245 places in 231 ms of which 1 ms to minimize.
[2024-05-31 03:51:22] [INFO ] Deduced a trap composed of 236 places in 293 ms of which 0 ms to minimize.
[2024-05-31 03:51:23] [INFO ] Deduced a trap composed of 221 places in 227 ms of which 0 ms to minimize.
[2024-05-31 03:51:23] [INFO ] Deduced a trap composed of 239 places in 366 ms of which 1 ms to minimize.
[2024-05-31 03:51:24] [INFO ] Deduced a trap composed of 230 places in 344 ms of which 1 ms to minimize.
[2024-05-31 03:51:24] [INFO ] Deduced a trap composed of 240 places in 339 ms of which 1 ms to minimize.
[2024-05-31 03:51:25] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 2 ms to minimize.
[2024-05-31 03:51:25] [INFO ] Deduced a trap composed of 245 places in 262 ms of which 1 ms to minimize.
[2024-05-31 03:51:26] [INFO ] Deduced a trap composed of 242 places in 319 ms of which 2 ms to minimize.
[2024-05-31 03:51:35] [INFO ] Trap strengthening (SAT) tested/added 20/20 trap constraints in 17624 ms
[2024-05-31 03:51:35] [INFO ] After 18096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 03:51:35] [INFO ] After 19019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 62 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 62 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-31 03:51:35] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 03:51:35] [INFO ] Invariant cache hit.
[2024-05-31 03:51:36] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-05-31 03:51:36] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 03:51:36] [INFO ] Invariant cache hit.
[2024-05-31 03:51:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:51:40] [INFO ] Implicit Places using invariants and state equation in 3928 ms returned []
Implicit Place search using SMT with State Equation took 4806 ms to find 0 implicit places.
[2024-05-31 03:51:40] [INFO ] Redundant transitions in 108 ms returned []
[2024-05-31 03:51:40] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 03:51:40] [INFO ] Invariant cache hit.
[2024-05-31 03:51:41] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5725 ms. Remains : 770/770 places, 1086/1086 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1082
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 770 transition count 1081
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 769 transition count 1081
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1080
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 768 transition count 1075
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 763 transition count 1075
Applied a total of 18 rules in 110 ms. Remains 763 /770 variables (removed 7) and now considering 1075/1086 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1075 rows 763 cols
[2024-05-31 03:51:41] [INFO ] Computed 137 invariants in 17 ms
[2024-05-31 03:51:41] [INFO ] [Real]Absence check using 130 positive place invariants in 24 ms returned sat
[2024-05-31 03:51:41] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 03:51:41] [INFO ] After 293ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 03:51:42] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 0 ms to minimize.
[2024-05-31 03:51:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2024-05-31 03:51:42] [INFO ] After 642ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:51:42] [INFO ] After 811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:51:42] [INFO ] [Nat]Absence check using 130 positive place invariants in 30 ms returned sat
[2024-05-31 03:51:42] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-31 03:51:42] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:51:43] [INFO ] Deduced a trap composed of 234 places in 327 ms of which 2 ms to minimize.
[2024-05-31 03:51:43] [INFO ] Deduced a trap composed of 249 places in 375 ms of which 1 ms to minimize.
[2024-05-31 03:51:43] [INFO ] Deduced a trap composed of 231 places in 378 ms of which 9 ms to minimize.
[2024-05-31 03:51:44] [INFO ] Deduced a trap composed of 243 places in 377 ms of which 1 ms to minimize.
[2024-05-31 03:51:45] [INFO ] Deduced a trap composed of 225 places in 434 ms of which 1 ms to minimize.
[2024-05-31 03:51:45] [INFO ] Deduced a trap composed of 240 places in 274 ms of which 0 ms to minimize.
[2024-05-31 03:51:45] [INFO ] Deduced a trap composed of 231 places in 269 ms of which 1 ms to minimize.
[2024-05-31 03:51:46] [INFO ] Deduced a trap composed of 240 places in 302 ms of which 1 ms to minimize.
[2024-05-31 03:51:46] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 0 ms to minimize.
[2024-05-31 03:51:46] [INFO ] Deduced a trap composed of 231 places in 286 ms of which 1 ms to minimize.
[2024-05-31 03:51:47] [INFO ] Deduced a trap composed of 234 places in 356 ms of which 3 ms to minimize.
[2024-05-31 03:51:47] [INFO ] Deduced a trap composed of 234 places in 297 ms of which 1 ms to minimize.
[2024-05-31 03:51:48] [INFO ] Deduced a trap composed of 231 places in 265 ms of which 3 ms to minimize.
[2024-05-31 03:51:48] [INFO ] Deduced a trap composed of 228 places in 304 ms of which 2 ms to minimize.
[2024-05-31 03:51:48] [INFO ] Deduced a trap composed of 225 places in 308 ms of which 2 ms to minimize.
[2024-05-31 03:51:56] [INFO ] Deduced a trap composed of 246 places in 7468 ms of which 1 ms to minimize.
[2024-05-31 03:51:56] [INFO ] Deduced a trap composed of 243 places in 309 ms of which 1 ms to minimize.
[2024-05-31 03:51:57] [INFO ] Deduced a trap composed of 225 places in 353 ms of which 1 ms to minimize.
[2024-05-31 03:51:57] [INFO ] Deduced a trap composed of 225 places in 296 ms of which 1 ms to minimize.
[2024-05-31 03:51:57] [INFO ] Deduced a trap composed of 240 places in 281 ms of which 1 ms to minimize.
[2024-05-31 03:51:58] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 1 ms to minimize.
[2024-05-31 03:51:58] [INFO ] Deduced a trap composed of 243 places in 294 ms of which 1 ms to minimize.
[2024-05-31 03:51:59] [INFO ] Deduced a trap composed of 237 places in 284 ms of which 1 ms to minimize.
[2024-05-31 03:51:59] [INFO ] Deduced a trap composed of 246 places in 308 ms of which 1 ms to minimize.
[2024-05-31 03:51:59] [INFO ] Deduced a trap composed of 228 places in 330 ms of which 0 ms to minimize.
[2024-05-31 03:52:00] [INFO ] Deduced a trap composed of 231 places in 311 ms of which 1 ms to minimize.
[2024-05-31 03:52:00] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 1 ms to minimize.
[2024-05-31 03:52:01] [INFO ] Deduced a trap composed of 240 places in 306 ms of which 2 ms to minimize.
[2024-05-31 03:52:01] [INFO ] Deduced a trap composed of 228 places in 308 ms of which 0 ms to minimize.
[2024-05-31 03:52:02] [INFO ] Deduced a trap composed of 222 places in 352 ms of which 1 ms to minimize.
[2024-05-31 03:52:02] [INFO ] Deduced a trap composed of 246 places in 305 ms of which 1 ms to minimize.
[2024-05-31 03:52:02] [INFO ] Deduced a trap composed of 243 places in 377 ms of which 1 ms to minimize.
[2024-05-31 03:52:03] [INFO ] Deduced a trap composed of 225 places in 386 ms of which 1 ms to minimize.
[2024-05-31 03:52:03] [INFO ] Deduced a trap composed of 228 places in 347 ms of which 1 ms to minimize.
[2024-05-31 03:52:04] [INFO ] Deduced a trap composed of 231 places in 527 ms of which 1 ms to minimize.
[2024-05-31 03:52:05] [INFO ] Deduced a trap composed of 249 places in 444 ms of which 2 ms to minimize.
[2024-05-31 03:52:05] [INFO ] Deduced a trap composed of 240 places in 450 ms of which 1 ms to minimize.
[2024-05-31 03:52:06] [INFO ] Deduced a trap composed of 231 places in 368 ms of which 1 ms to minimize.
[2024-05-31 03:52:07] [INFO ] Deduced a trap composed of 225 places in 572 ms of which 1 ms to minimize.
[2024-05-31 03:52:07] [INFO ] Deduced a trap composed of 240 places in 407 ms of which 1 ms to minimize.
[2024-05-31 03:52:08] [INFO ] Deduced a trap composed of 246 places in 392 ms of which 1 ms to minimize.
[2024-05-31 03:52:08] [INFO ] Deduced a trap composed of 240 places in 427 ms of which 2 ms to minimize.
[2024-05-31 03:52:09] [INFO ] Deduced a trap composed of 240 places in 388 ms of which 1 ms to minimize.
[2024-05-31 03:52:10] [INFO ] Deduced a trap composed of 228 places in 376 ms of which 1 ms to minimize.
[2024-05-31 03:52:10] [INFO ] Deduced a trap composed of 231 places in 397 ms of which 1 ms to minimize.
[2024-05-31 03:52:11] [INFO ] Deduced a trap composed of 219 places in 398 ms of which 1 ms to minimize.
[2024-05-31 03:52:11] [INFO ] Deduced a trap composed of 222 places in 362 ms of which 1 ms to minimize.
[2024-05-31 03:52:12] [INFO ] Deduced a trap composed of 243 places in 370 ms of which 1 ms to minimize.
[2024-05-31 03:52:12] [INFO ] Deduced a trap composed of 225 places in 285 ms of which 0 ms to minimize.
[2024-05-31 03:52:12] [INFO ] Deduced a trap composed of 231 places in 377 ms of which 2 ms to minimize.
[2024-05-31 03:52:13] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 0 ms to minimize.
[2024-05-31 03:52:13] [INFO ] Deduced a trap composed of 237 places in 380 ms of which 0 ms to minimize.
[2024-05-31 03:52:14] [INFO ] Deduced a trap composed of 222 places in 424 ms of which 1 ms to minimize.
[2024-05-31 03:52:14] [INFO ] Deduced a trap composed of 237 places in 279 ms of which 1 ms to minimize.
[2024-05-31 03:52:15] [INFO ] Deduced a trap composed of 252 places in 427 ms of which 0 ms to minimize.
[2024-05-31 03:52:15] [INFO ] Deduced a trap composed of 243 places in 392 ms of which 1 ms to minimize.
[2024-05-31 03:52:15] [INFO ] Deduced a trap composed of 225 places in 315 ms of which 1 ms to minimize.
[2024-05-31 03:52:16] [INFO ] Deduced a trap composed of 249 places in 453 ms of which 2 ms to minimize.
[2024-05-31 03:52:17] [INFO ] Deduced a trap composed of 240 places in 505 ms of which 2 ms to minimize.
[2024-05-31 03:52:28] [INFO ] Deduced a trap composed of 231 places in 10999 ms of which 26 ms to minimize.
[2024-05-31 03:52:29] [INFO ] Deduced a trap composed of 252 places in 413 ms of which 1 ms to minimize.
[2024-05-31 03:52:31] [INFO ] Deduced a trap composed of 216 places in 355 ms of which 0 ms to minimize.
[2024-05-31 03:52:31] [INFO ] Deduced a trap composed of 231 places in 548 ms of which 1 ms to minimize.
[2024-05-31 03:52:32] [INFO ] Deduced a trap composed of 234 places in 296 ms of which 0 ms to minimize.
[2024-05-31 03:52:32] [INFO ] Deduced a trap composed of 231 places in 429 ms of which 1 ms to minimize.
[2024-05-31 03:52:33] [INFO ] Deduced a trap composed of 249 places in 469 ms of which 1 ms to minimize.
[2024-05-31 03:52:33] [INFO ] Deduced a trap composed of 252 places in 378 ms of which 1 ms to minimize.
[2024-05-31 03:52:34] [INFO ] Deduced a trap composed of 234 places in 441 ms of which 1 ms to minimize.
[2024-05-31 03:52:35] [INFO ] Deduced a trap composed of 249 places in 354 ms of which 1 ms to minimize.
[2024-05-31 03:52:36] [INFO ] Deduced a trap composed of 231 places in 415 ms of which 1 ms to minimize.
[2024-05-31 03:52:36] [INFO ] Deduced a trap composed of 225 places in 345 ms of which 1 ms to minimize.
[2024-05-31 03:52:37] [INFO ] Deduced a trap composed of 246 places in 284 ms of which 0 ms to minimize.
[2024-05-31 03:52:37] [INFO ] Deduced a trap composed of 231 places in 363 ms of which 1 ms to minimize.
[2024-05-31 03:52:38] [INFO ] Deduced a trap composed of 231 places in 321 ms of which 1 ms to minimize.
[2024-05-31 03:52:38] [INFO ] Deduced a trap composed of 216 places in 371 ms of which 1 ms to minimize.
[2024-05-31 03:52:39] [INFO ] Deduced a trap composed of 225 places in 324 ms of which 1 ms to minimize.
[2024-05-31 03:52:41] [INFO ] Deduced a trap composed of 234 places in 381 ms of which 1 ms to minimize.
[2024-05-31 03:52:42] [INFO ] Deduced a trap composed of 246 places in 561 ms of which 3 ms to minimize.
[2024-05-31 03:52:43] [INFO ] Deduced a trap composed of 234 places in 385 ms of which 1 ms to minimize.
[2024-05-31 03:52:44] [INFO ] Deduced a trap composed of 252 places in 321 ms of which 1 ms to minimize.
[2024-05-31 03:52:44] [INFO ] Deduced a trap composed of 243 places in 415 ms of which 3 ms to minimize.
[2024-05-31 03:52:44] [INFO ] Deduced a trap composed of 249 places in 295 ms of which 1 ms to minimize.
[2024-05-31 03:52:45] [INFO ] Deduced a trap composed of 237 places in 359 ms of which 1 ms to minimize.
[2024-05-31 03:52:45] [INFO ] Deduced a trap composed of 234 places in 336 ms of which 1 ms to minimize.
[2024-05-31 03:52:46] [INFO ] Deduced a trap composed of 231 places in 367 ms of which 1 ms to minimize.
[2024-05-31 03:52:48] [INFO ] Deduced a trap composed of 222 places in 271 ms of which 0 ms to minimize.
[2024-05-31 03:52:49] [INFO ] Deduced a trap composed of 252 places in 307 ms of which 2 ms to minimize.
[2024-05-31 03:52:49] [INFO ] Deduced a trap composed of 225 places in 339 ms of which 0 ms to minimize.
[2024-05-31 03:52:50] [INFO ] Deduced a trap composed of 237 places in 378 ms of which 5 ms to minimize.
[2024-05-31 03:52:50] [INFO ] Deduced a trap composed of 252 places in 370 ms of which 1 ms to minimize.
[2024-05-31 03:52:51] [INFO ] Deduced a trap composed of 237 places in 347 ms of which 1 ms to minimize.
[2024-05-31 03:52:51] [INFO ] Deduced a trap composed of 225 places in 300 ms of which 0 ms to minimize.
[2024-05-31 03:52:52] [INFO ] Deduced a trap composed of 237 places in 414 ms of which 1 ms to minimize.
[2024-05-31 03:52:53] [INFO ] Deduced a trap composed of 243 places in 272 ms of which 1 ms to minimize.
[2024-05-31 03:52:54] [INFO ] Deduced a trap composed of 240 places in 338 ms of which 1 ms to minimize.
[2024-05-31 03:52:54] [INFO ] Deduced a trap composed of 249 places in 318 ms of which 0 ms to minimize.
[2024-05-31 03:52:56] [INFO ] Deduced a trap composed of 222 places in 306 ms of which 1 ms to minimize.
[2024-05-31 03:52:59] [INFO ] Deduced a trap composed of 225 places in 299 ms of which 1 ms to minimize.
[2024-05-31 03:53:02] [INFO ] Deduced a trap composed of 234 places in 298 ms of which 1 ms to minimize.
[2024-05-31 03:53:05] [INFO ] Deduced a trap composed of 228 places in 345 ms of which 1 ms to minimize.
[2024-05-31 03:53:07] [INFO ] Deduced a trap composed of 237 places in 342 ms of which 0 ms to minimize.
[2024-05-31 03:53:08] [INFO ] Deduced a trap composed of 237 places in 349 ms of which 1 ms to minimize.
[2024-05-31 03:53:09] [INFO ] Deduced a trap composed of 240 places in 359 ms of which 1 ms to minimize.
[2024-05-31 03:53:11] [INFO ] Deduced a trap composed of 231 places in 324 ms of which 3 ms to minimize.
[2024-05-31 03:53:12] [INFO ] Deduced a trap composed of 234 places in 336 ms of which 1 ms to minimize.
[2024-05-31 03:53:13] [INFO ] Deduced a trap composed of 249 places in 320 ms of which 1 ms to minimize.
[2024-05-31 03:53:13] [INFO ] Deduced a trap composed of 228 places in 321 ms of which 1 ms to minimize.
[2024-05-31 03:53:13] [INFO ] Deduced a trap composed of 220 places in 289 ms of which 1 ms to minimize.
[2024-05-31 03:53:14] [INFO ] Deduced a trap composed of 226 places in 338 ms of which 1 ms to minimize.
[2024-05-31 03:53:14] [INFO ] Deduced a trap composed of 240 places in 323 ms of which 2 ms to minimize.
[2024-05-31 03:53:14] [INFO ] Deduced a trap composed of 255 places in 326 ms of which 1 ms to minimize.
[2024-05-31 03:53:15] [INFO ] Deduced a trap composed of 237 places in 229 ms of which 0 ms to minimize.
[2024-05-31 03:53:16] [INFO ] Deduced a trap composed of 237 places in 277 ms of which 1 ms to minimize.
[2024-05-31 03:53:16] [INFO ] Deduced a trap composed of 237 places in 253 ms of which 1 ms to minimize.
[2024-05-31 03:53:19] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 1 ms to minimize.
[2024-05-31 03:53:20] [INFO ] Deduced a trap composed of 237 places in 287 ms of which 1 ms to minimize.
[2024-05-31 03:53:20] [INFO ] Deduced a trap composed of 234 places in 326 ms of which 1 ms to minimize.
[2024-05-31 03:53:21] [INFO ] Deduced a trap composed of 252 places in 325 ms of which 0 ms to minimize.
[2024-05-31 03:53:21] [INFO ] Deduced a trap composed of 246 places in 334 ms of which 1 ms to minimize.
[2024-05-31 03:53:22] [INFO ] Deduced a trap composed of 234 places in 306 ms of which 1 ms to minimize.
[2024-05-31 03:53:24] [INFO ] Deduced a trap composed of 222 places in 334 ms of which 1 ms to minimize.
[2024-05-31 03:53:24] [INFO ] Deduced a trap composed of 243 places in 252 ms of which 1 ms to minimize.
[2024-05-31 03:53:24] [INFO ] Deduced a trap composed of 237 places in 317 ms of which 0 ms to minimize.
[2024-05-31 03:53:25] [INFO ] Deduced a trap composed of 237 places in 310 ms of which 0 ms to minimize.
[2024-05-31 03:53:25] [INFO ] Deduced a trap composed of 231 places in 340 ms of which 1 ms to minimize.
[2024-05-31 03:53:26] [INFO ] Deduced a trap composed of 216 places in 319 ms of which 0 ms to minimize.
[2024-05-31 03:53:28] [INFO ] Deduced a trap composed of 231 places in 344 ms of which 1 ms to minimize.
[2024-05-31 03:53:35] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 1 ms to minimize.
[2024-05-31 03:53:44] [INFO ] Trap strengthening (SAT) tested/added 128/128 trap constraints in 122289 ms
[2024-05-31 03:53:45] [INFO ] After 122722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 03:53:45] [INFO ] After 122914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2024-05-31 03:53:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-31 03:53:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 770 places, 1086 transitions and 5509 arcs took 21 ms.
[2024-05-31 03:53:45] [INFO ] Flatten gal took : 172 ms
Total runtime 197637 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-COL-S05J60
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityFireability
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1717127625911
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 4 (type SKEL/FNDP) for 0 PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type SKEL/EQUN) for 0 PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type SKEL/SRCH) for 0 PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type SKEL/SRCH) for 0 PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SKEL/SRCH) for PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04
lola: result : false
lola: markings : 2431
lola: fired transitions : 4871
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 5 (type EQUN) for PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 8 (type SRCH) for PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04: EF false skeleton: tandem / insertion
Time elapsed: 0 secs. Pages in use: 2
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="PolyORBNT-COL-S05J60"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-COL-S05J60, 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 r307-tajo-171654460800245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 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 '
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 ;