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

About the Execution of 2022-gold for BugTracking-PT-q8m128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16216.315 3600000.00 3543634.00 78342.20 0 0 0 0 0 0 1 ? ? 0 0 0 ? 1 0 0 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/mcc2023-input.r063-tajo-167813711600055.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is BugTracking-PT-q8m128, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-tajo-167813711600055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Feb 26 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 06:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 06:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678930845577

Running Version 202205111006
[2023-03-16 01:40:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 01:40:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:40:47] [INFO ] Load time of PNML (sax parser for PT used): 806 ms
[2023-03-16 01:40:47] [INFO ] Transformed 754 places.
[2023-03-16 01:40:48] [INFO ] Transformed 27370 transitions.
[2023-03-16 01:40:48] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1025 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 474 places in 109 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-16 01:40:48] [INFO ] Computed 10 place invariants in 72 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :2
FORMULA BugTracking-PT-q8m128-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m128-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
[2023-03-16 01:40:48] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-16 01:40:48] [INFO ] Computed 10 place invariants in 16 ms
[2023-03-16 01:40:48] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-16 01:40:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:49] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2023-03-16 01:40:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:40:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-16 01:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:50] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2023-03-16 01:40:50] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-16 01:40:50] [INFO ] [Nat]Added 303 Read/Feed constraints in 59 ms returned sat
[2023-03-16 01:40:51] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 423 ms.
[2023-03-16 01:40:51] [INFO ] Added : 2 causal constraints over 1 iterations in 916 ms. Result :sat
[2023-03-16 01:40:51] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-16 01:40:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:52] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2023-03-16 01:40:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:40:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-16 01:40:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:53] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2023-03-16 01:40:53] [INFO ] [Nat]Added 303 Read/Feed constraints in 242 ms returned sat
[2023-03-16 01:40:53] [INFO ] Deduced a trap composed of 73 places in 445 ms of which 4 ms to minimize.
[2023-03-16 01:40:54] [INFO ] Deduced a trap composed of 19 places in 561 ms of which 2 ms to minimize.
[2023-03-16 01:40:55] [INFO ] Deduced a trap composed of 11 places in 381 ms of which 1 ms to minimize.
[2023-03-16 01:40:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1829 ms
[2023-03-16 01:40:55] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 316 ms.
[2023-03-16 01:40:56] [INFO ] Added : 3 causal constraints over 1 iterations in 738 ms. Result :sat
[2023-03-16 01:40:56] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-16 01:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:56] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2023-03-16 01:40:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:40:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-16 01:40:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:57] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2023-03-16 01:40:57] [INFO ] [Nat]Added 303 Read/Feed constraints in 191 ms returned sat
[2023-03-16 01:40:58] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 2 ms to minimize.
[2023-03-16 01:40:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 658 ms
[2023-03-16 01:40:58] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 366 ms.
[2023-03-16 01:40:59] [INFO ] Deduced a trap composed of 19 places in 484 ms of which 1 ms to minimize.
[2023-03-16 01:41:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 707 ms
[2023-03-16 01:41:00] [INFO ] Added : 9 causal constraints over 2 iterations in 1943 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, -1] Max seen :[0, 0, 0]
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.52 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 558 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:41:02] [INFO ] Computed 8 place invariants in 40 ms
Incomplete random walk after 1000083 steps, including 2 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2094 ms. (steps per millisecond=477 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1615 ms. (steps per millisecond=619 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1656 ms. (steps per millisecond=603 ) properties (out of 3) seen :0
[2023-03-16 01:41:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:41:08] [INFO ] Computed 8 place invariants in 37 ms
[2023-03-16 01:41:08] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:09] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2023-03-16 01:41:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:41:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 01:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:09] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2023-03-16 01:41:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:41:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 51 ms returned sat
[2023-03-16 01:41:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 313 ms.
[2023-03-16 01:41:11] [INFO ] Deduced a trap composed of 31 places in 572 ms of which 1 ms to minimize.
[2023-03-16 01:41:12] [INFO ] Deduced a trap composed of 53 places in 367 ms of which 1 ms to minimize.
[2023-03-16 01:41:12] [INFO ] Deduced a trap composed of 53 places in 341 ms of which 0 ms to minimize.
[2023-03-16 01:41:15] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 4654 ms
[2023-03-16 01:41:54] [INFO ] Deduced a trap composed of 7 places in 788 ms of which 1 ms to minimize.
[2023-03-16 01:41:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-16 01:41:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:55] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2023-03-16 01:41:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:41:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:56] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2023-03-16 01:41:56] [INFO ] [Nat]Added 283 Read/Feed constraints in 162 ms returned sat
[2023-03-16 01:41:56] [INFO ] Deduced a trap composed of 18 places in 460 ms of which 0 ms to minimize.
[2023-03-16 01:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 693 ms
[2023-03-16 01:41:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 321 ms.
[2023-03-16 01:41:57] [INFO ] Added : 4 causal constraints over 1 iterations in 762 ms. Result :sat
[2023-03-16 01:41:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:58] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2023-03-16 01:41:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:41:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:59] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2023-03-16 01:41:59] [INFO ] [Nat]Added 283 Read/Feed constraints in 309 ms returned sat
[2023-03-16 01:42:00] [INFO ] Deduced a trap composed of 10 places in 659 ms of which 0 ms to minimize.
[2023-03-16 01:42:00] [INFO ] Deduced a trap composed of 40 places in 488 ms of which 1 ms to minimize.
[2023-03-16 01:42:01] [INFO ] Deduced a trap composed of 52 places in 455 ms of which 1 ms to minimize.
[2023-03-16 01:42:02] [INFO ] Deduced a trap composed of 56 places in 493 ms of which 0 ms to minimize.
[2023-03-16 01:42:02] [INFO ] Deduced a trap composed of 42 places in 471 ms of which 1 ms to minimize.
[2023-03-16 01:42:03] [INFO ] Deduced a trap composed of 54 places in 499 ms of which 0 ms to minimize.
[2023-03-16 01:42:04] [INFO ] Deduced a trap composed of 31 places in 476 ms of which 1 ms to minimize.
[2023-03-16 01:42:04] [INFO ] Deduced a trap composed of 55 places in 470 ms of which 0 ms to minimize.
[2023-03-16 01:42:05] [INFO ] Deduced a trap composed of 30 places in 464 ms of which 0 ms to minimize.
[2023-03-16 01:42:05] [INFO ] Deduced a trap composed of 21 places in 345 ms of which 0 ms to minimize.
[2023-03-16 01:42:06] [INFO ] Deduced a trap composed of 10 places in 430 ms of which 1 ms to minimize.
[2023-03-16 01:42:07] [INFO ] Deduced a trap composed of 41 places in 439 ms of which 1 ms to minimize.
[2023-03-16 01:42:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7851 ms
[2023-03-16 01:42:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 320 ms.
[2023-03-16 01:42:08] [INFO ] Added : 6 causal constraints over 2 iterations in 967 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, -1] Max seen :[0, 0, 0]
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:42:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:08] [INFO ] Computed 8 place invariants in 28 ms
[2023-03-16 01:42:09] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-03-16 01:42:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:09] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:42:10] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:11] [INFO ] Implicit Places using invariants and state equation in 2390 ms returned []
Implicit Place search using SMT with State Equation took 2941 ms to find 0 implicit places.
[2023-03-16 01:42:12] [INFO ] Redundant transitions in 374 ms returned []
[2023-03-16 01:42:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:12] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-16 01:42:13] [INFO ] Dead Transitions using invariants and state equation in 1289 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-07
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:13] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 10045 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1255 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-16 01:42:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:13] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-16 01:42:13] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-16 01:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:14] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2023-03-16 01:42:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:42:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:14] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2023-03-16 01:42:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:14] [INFO ] [Nat]Added 283 Read/Feed constraints in 40 ms returned sat
[2023-03-16 01:42:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 324 ms.
[2023-03-16 01:42:16] [INFO ] Deduced a trap composed of 31 places in 620 ms of which 1 ms to minimize.
[2023-03-16 01:42:16] [INFO ] Deduced a trap composed of 53 places in 390 ms of which 0 ms to minimize.
[2023-03-16 01:42:17] [INFO ] Deduced a trap composed of 53 places in 402 ms of which 1 ms to minimize.
[2023-03-16 01:42:19] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 3398 ms
[2023-03-16 01:42:19] [INFO ] Deduced a trap composed of 7 places in 794 ms of which 1 ms to minimize.
[2023-03-16 01:42:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 64 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:19] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 1000050 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1867 ms. (steps per millisecond=535 ) properties (out of 1) seen :0
[2023-03-16 01:42:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:22] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:42:22] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:23] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2023-03-16 01:42:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:42:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:24] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2023-03-16 01:42:24] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 48 ms returned sat
[2023-03-16 01:42:24] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 261 ms.
[2023-03-16 01:42:25] [INFO ] Deduced a trap composed of 31 places in 553 ms of which 1 ms to minimize.
[2023-03-16 01:42:26] [INFO ] Deduced a trap composed of 53 places in 388 ms of which 1 ms to minimize.
[2023-03-16 01:42:26] [INFO ] Deduced a trap composed of 53 places in 358 ms of which 1 ms to minimize.
[2023-03-16 01:42:29] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 4694 ms
[2023-03-16 01:43:09] [INFO ] Deduced a trap composed of 7 places in 828 ms of which 1 ms to minimize.
[2023-03-16 01:43:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:43:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:09] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-16 01:43:09] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-16 01:43:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:09] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-16 01:43:10] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:43:11] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2217 ms to find 0 implicit places.
[2023-03-16 01:43:11] [INFO ] Redundant transitions in 219 ms returned []
[2023-03-16 01:43:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:11] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-16 01:43:12] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-07 in 59501 ms.
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:12] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10053 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1436 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
[2023-03-16 01:43:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:12] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-16 01:43:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:13] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2023-03-16 01:43:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:43:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-16 01:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:13] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2023-03-16 01:43:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:43:14] [INFO ] [Nat]Added 283 Read/Feed constraints in 165 ms returned sat
[2023-03-16 01:43:14] [INFO ] Deduced a trap composed of 18 places in 407 ms of which 0 ms to minimize.
[2023-03-16 01:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 621 ms
[2023-03-16 01:43:14] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 263 ms.
[2023-03-16 01:43:15] [INFO ] Added : 4 causal constraints over 1 iterations in 694 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:15] [INFO ] Computed 8 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2012 ms. (steps per millisecond=497 ) properties (out of 1) seen :0
[2023-03-16 01:43:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:18] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:43:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:18] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2023-03-16 01:43:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:43:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:43:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:19] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2023-03-16 01:43:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:43:19] [INFO ] [Nat]Added 283 Read/Feed constraints in 225 ms returned sat
[2023-03-16 01:43:20] [INFO ] Deduced a trap composed of 18 places in 471 ms of which 2 ms to minimize.
[2023-03-16 01:43:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 720 ms
[2023-03-16 01:43:20] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 294 ms.
[2023-03-16 01:43:21] [INFO ] Added : 4 causal constraints over 1 iterations in 719 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 66 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:43:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:21] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-16 01:43:22] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-16 01:43:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:22] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-16 01:43:22] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:43:24] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2382 ms to find 0 implicit places.
[2023-03-16 01:43:24] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-16 01:43:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:24] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-16 01:43:25] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-08 in 12510 ms.
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:25] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 10013 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
[2023-03-16 01:43:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:25] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-16 01:43:25] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:25] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-16 01:43:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:43:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 01:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:26] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2023-03-16 01:43:26] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:43:27] [INFO ] [Nat]Added 283 Read/Feed constraints in 374 ms returned sat
[2023-03-16 01:43:27] [INFO ] Deduced a trap composed of 10 places in 714 ms of which 10 ms to minimize.
[2023-03-16 01:43:28] [INFO ] Deduced a trap composed of 40 places in 509 ms of which 1 ms to minimize.
[2023-03-16 01:43:29] [INFO ] Deduced a trap composed of 52 places in 488 ms of which 1 ms to minimize.
[2023-03-16 01:43:29] [INFO ] Deduced a trap composed of 56 places in 500 ms of which 0 ms to minimize.
[2023-03-16 01:43:30] [INFO ] Deduced a trap composed of 42 places in 471 ms of which 1 ms to minimize.
[2023-03-16 01:43:31] [INFO ] Deduced a trap composed of 54 places in 532 ms of which 1 ms to minimize.
[2023-03-16 01:43:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 79 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:31] [INFO ] Computed 8 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1848 ms. (steps per millisecond=541 ) properties (out of 1) seen :0
[2023-03-16 01:43:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:33] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-16 01:43:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:34] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2023-03-16 01:43:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:43:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:35] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2023-03-16 01:43:35] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:43:35] [INFO ] [Nat]Added 283 Read/Feed constraints in 271 ms returned sat
[2023-03-16 01:43:36] [INFO ] Deduced a trap composed of 10 places in 694 ms of which 1 ms to minimize.
[2023-03-16 01:43:36] [INFO ] Deduced a trap composed of 40 places in 464 ms of which 0 ms to minimize.
[2023-03-16 01:43:37] [INFO ] Deduced a trap composed of 52 places in 466 ms of which 0 ms to minimize.
[2023-03-16 01:43:38] [INFO ] Deduced a trap composed of 56 places in 448 ms of which 1 ms to minimize.
[2023-03-16 01:43:38] [INFO ] Deduced a trap composed of 42 places in 474 ms of which 1 ms to minimize.
[2023-03-16 01:43:39] [INFO ] Deduced a trap composed of 54 places in 496 ms of which 1 ms to minimize.
[2023-03-16 01:43:39] [INFO ] Deduced a trap composed of 31 places in 431 ms of which 0 ms to minimize.
[2023-03-16 01:43:40] [INFO ] Deduced a trap composed of 55 places in 451 ms of which 7 ms to minimize.
[2023-03-16 01:43:41] [INFO ] Deduced a trap composed of 30 places in 459 ms of which 1 ms to minimize.
[2023-03-16 01:43:41] [INFO ] Deduced a trap composed of 21 places in 371 ms of which 1 ms to minimize.
[2023-03-16 01:43:42] [INFO ] Deduced a trap composed of 10 places in 459 ms of which 1 ms to minimize.
[2023-03-16 01:43:43] [INFO ] Deduced a trap composed of 41 places in 442 ms of which 1 ms to minimize.
[2023-03-16 01:43:43] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7627 ms
[2023-03-16 01:43:43] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 338 ms.
[2023-03-16 01:43:44] [INFO ] Added : 6 causal constraints over 2 iterations in 936 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 109 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:43:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:44] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:43:44] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-16 01:43:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:44] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-16 01:43:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:43:46] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2023-03-16 01:43:46] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-16 01:43:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:46] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-16 01:43:48] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-12 in 22587 ms.
[2023-03-16 01:43:49] [INFO ] Flatten gal took : 482 ms
[2023-03-16 01:43:49] [INFO ] Applying decomposition
[2023-03-16 01:43:49] [INFO ] Flatten gal took : 214 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10368440111687726519.txt' '-o' '/tmp/graph10368440111687726519.bin' '-w' '/tmp/graph10368440111687726519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10368440111687726519.bin' '-l' '-1' '-v' '-w' '/tmp/graph10368440111687726519.weights' '-q' '0' '-e' '0.001'
[2023-03-16 01:43:50] [INFO ] Decomposing Gal with order
[2023-03-16 01:43:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 01:43:50] [INFO ] Removed a total of 424 redundant transitions.
[2023-03-16 01:43:50] [INFO ] Flatten gal took : 441 ms
[2023-03-16 01:43:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 30 ms.
[2023-03-16 01:43:50] [INFO ] Time to serialize gal into /tmp/UpperBounds11414103875355139560.gal : 50 ms
[2023-03-16 01:43:50] [INFO ] Time to serialize properties into /tmp/UpperBounds17669751321219655814.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11414103875355139560.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17669751321219655814.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds17669751321219655814.prop.
Detected timeout of ITS tools.
[2023-03-16 02:04:57] [INFO ] Flatten gal took : 3971 ms
[2023-03-16 02:04:57] [INFO ] Time to serialize gal into /tmp/UpperBounds2851584914840199472.gal : 75 ms
[2023-03-16 02:04:57] [INFO ] Time to serialize properties into /tmp/UpperBounds11711670104524754895.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2851584914840199472.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11711670104524754895.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds11711670104524754895.prop.
Detected timeout of ITS tools.
[2023-03-16 02:25:59] [INFO ] Flatten gal took : 468 ms
[2023-03-16 02:26:01] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-16 02:26:01] [INFO ] Transformed 269 places.
[2023-03-16 02:26:01] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 02:26:02] [INFO ] Time to serialize gal into /tmp/UpperBounds5839502923277741317.gal : 54 ms
[2023-03-16 02:26:02] [INFO ] Time to serialize properties into /tmp/UpperBounds10613982388905582071.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5839502923277741317.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10613982388905582071.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10613982388905582071.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BugTracking-PT-q8m128"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is BugTracking-PT-q8m128, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r063-tajo-167813711600055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m128.tgz
mv BugTracking-PT-q8m128 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;